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()
a = []
if len(s) < n:
    print ("NO")

else:
    for i in s:
        if len(a) == n:
            break
        if i in a:
            continue
        else:
            a.append(i)

    l = []
    for i in range(len(a)):
        if i == len(a)-1:
            l.append(s[s.index(a[i]):])
        else:
            l.append(s[s.index(a[i]):s.index(a[i+1])])

    if len(a) == n:
        print ("YES")
        for i in l:
            print (i)

    else:
        print ("NO")
