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())

used = set()

S = input()

indexes = []
ind = 0
while len(indexes) < K and ind < len(S):
    if S[ind] not in used:
        indexes += [ind]
        used.add(S[ind])
    ind += 1
        
if len(indexes) < K:
    print("NO")
else:
    print("YES")
    
    for i, v in enumerate(indexes):
        if i == len(indexes) - 1:
            print(S[v:])
        else:
            print(S[v:indexes[i+1]])
        
                