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.
"""
Pues yo creo que con que hayan k letras distintas sirve
"""

from sys import stdin

def solve(q, k):
    subs,s,s_set,N = list(),list(),set(q[0]),len(q)

    for n in range(N):
        if q[n] not in s_set and k != 1:
            subs.append(f"{''.join(s)}")
            k -= 1
            s_set.add(q[n])
            s = list(q[n])
        else:
            s.append(q[n])
    subs.append(f"{''.join(s)}")
    k -= 1
    if k == 0:
        print("YES")
        for sub in subs:
            print(sub)
    else:
        print("NO")

def main():
    k = int(stdin.readline())
    q = stdin.readline().rstrip()
    solve(q, k)

main()
