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.
k = int(input())
s = input()
sp = [-1] * 26
ln = 0
for i in range(len(s)):
    if sp[ord(s[i]) - ord('a')] == -1:
        ln += 1
        sp[ord(s[i]) - ord('a')] = i
if ln < k:
    print('NO')
    quit()
sp.append(len(s))
sp.sort()
print('YES')
ans = []
kol = 0
for i in range(len(sp)):
    if sp[i] != -1 and kol != k - 1:
        ans.append(s[sp[i]:sp[i+1]])
        kol += 1
    elif sp[i] != -1:
        ans.append(s[sp[i]:])
        break
for i in ans:
    print(i)
