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.
s=[]
indexes=[]
k=int(input(""))
q=input("")
for i in range(0,len(q)):
    if q[i] not in s:
        s.append(q[i])
        indexes.append(i)
if len(s)< k:
    print("NO")
else:
    print("YES")
    for x in range(len(indexes)):
        if x >=k-1:
            a=q[indexes[x]:len(q)]
            print(a)
            break  
        else:
            a=q[indexes[x]:indexes[x+1]]
            print(a)
              



        
    

            
            
        

