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())
s = input()
flag = 0
begin = []
result = []
begin.append(s[0])
j = 0
num = 1
i = 1
l = len(s)
if n > len(s):
    flag = 1
elif n == 1:
    result.append(s)
else:
    #print(s,len(s))
    while i < l:
        if (begin.__contains__(s[i])) == False:
            num += 1
            begin.append(s[i])
            result.append(s[:i])
            s = s[i:]
            i = 0
            l = len(s)
            if num == n:
                result.append(s)
                break
            continue
        l = len(s)
        i += 1
    if num < n:
        flag = 1
if flag == 1:
    print('NO')
else:
    print('YES')
    for i in result:
        print(i)
