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.
from sys import *

k=int(input())
s=input()
ee=set()
for i in s:
    ee.add(i)
if k>len(ee):
    print("NO")
    exit(0)
print("YES")
i=0
cur=s[0]
num=k
ee.discard(s[0])
while i<len(s):
    if s[i] in ee and num:
        print(cur)
        ee.discard(s[i])
        num-=1
        cur=s[i]
    else:
        cur+=s[i]
    i+=1
print(cur)