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.
n = int(input())
s = input()
end = 1 
start= 0
i = 0 
if len(set(s)) < n : 
    print("NO")
elif n == 1 :
     print("YES")
     print(s)
else : 
    stack =[]
    for i in s :
        if i not in stack:
            stack.append(i)
    for i in range(n-1) :
        print(s[s.index(stack[i]) : s.index(stack[i+1]) ])
    print(s[s.index(stack[i+1]) :])




            
            
        

