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.
    # 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.


K = int(input())

Q = input()

chars = set()

firstOcc = []

for i in range(len(Q)):
	if Q[i] not in chars:
		chars.add(Q[i])
		firstOcc.append(i)

if len(chars) < K:
	print("NO")
else:
	print("YES")
	index = 0
	for i in range(K):
		# last one
		if i != K - 1:
			print(Q[firstOcc[i]:firstOcc[i + 1]])
		else:
			print(Q[firstOcc[i]:])

				 	 		 		   	  			 		  		 	