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())
letters = set([])
pos = []
s = input()
counter = 0
for c in s:
    if not c in letters:
        letters.add(c)
        pos.append(counter)
        if len(letters)==n:
            break
    counter+=1
if len(letters) != n:
    print("NO")
    exit(0)
else:
    print("YES")
    pos.append(len(s))
    for i in range(len(pos)-1):
        print(s[pos[i]:pos[i+1]])