You are given a string *q*. A sequence of *k* strings *s*<sub class="lower-index">1</sub>, *s*<sub class="lower-index">2</sub>, ..., *s*<sub class="lower-index">*k*</sub> is called beautiful, if the concatenation of these strings is string *q* (formally, *s*<sub class="lower-index">1</sub> + *s*<sub class="lower-index">2</sub> + ... + *s*<sub class="lower-index">*k*</sub> = *q*) and the first characters of these strings are distinct.

Find any beautiful sequence of strings or determine that the beautiful sequence doesn't exist.
The first line contains a positive integer *k* (1 ≤ *k* ≤ 26) — the number of strings that should be in a beautiful sequence. 

The second line contains string *q*, consisting of lowercase Latin letters. The length of the string is within range from 1 to 100, inclusive.
def setOfString():
	q=input()
	si=[]
	lastAdded=0
	completedAlphabet=[]
	completedAlphabet.append(q[0])
	newString=''
	for i in q:
		if(completedAlphabet.count(i)==0):
			si.append(newString)
			newString=i
			completedAlphabet.append(i)
		else:
			newString+=i
	si.append(newString)
	return si

k=int(input())
setOfStrings=setOfString()
if(k>len(setOfStrings)):
	print("NO")
else:
	print("YES")
	for i in range(k-1):
		print(setOfStrings[i])
	print(str(setOfStrings[k-1:]).replace('[', '').replace(']', '').replace("'", '').replace(' ', '').replace(',', ''))