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())
d = {}
st = input()
ans =""
answer = [ ]
t=0
for j,i in enumerate (st) :
    if i in d :
        continue
    else :
        d[i]=1
        if n==1 :
            t=1
            answer.append(j)
            break
        answer.append(j)
        n=n-1
if t!=1 :
    exit(print("NO"))
print("YES")
le = len(answer)-1
for i,j in enumerate (answer) :
    if i== le :
        print(st[answer[i]: len(st)])
        break
    print(st[answer[i]:answer[i+1]]  )
    
    
    