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.
t = int(input())
s = list(input())

p = len(set(s))
if(p < t):
    print('NO')
else:
    f = [False for i in range(26)]
    c = []
    l = ''
    for i in range(len(s)):
        if(t == 0):
            c.append(l+str(''.join(s[i:])))
            break
        if(f[ord(s[i])-97]!=True):
            if(l!=''):
                c.append(l)
            l = s[i]
            f[ord(s[i])-97] = True
            t-=1
        else:
            l+=s[i]
    print('YES')
    for i in range(len(c)):
        print(c[i])
    