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.
while True:
    line = input()
    if not line:
        break
    n, s = line.split()
    n = int(n)
    mrk = [0] * 200
    v = []
    cnt = 0

    for i in range(len(s)):
        if mrk[ord(s[i])] == 0:
            v.append(i)
            mrk[ord(s[i])] = 1

    if n == 1:
        print("YES")
        print(s)
    elif len(v) >= n:
        print("YES")
        print(s[0])
        j = 1
        for i in range(1, len(s)):
            if v[j] == i and n > 1:
                print()
                n -= 1
                j += 1
            print(s[i])
        print()
    else:
        print("NO")
