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.
import sys
import math
import bisect

def solve(s, k):
    d = dict()
    for i in range(len(s)):
        if s[i] not in d:
            d[s[i]] = i
    A = list(d.values())
    #print('s: %s, k: %d, A: %s' % (s, k, A))
    if len(A) < k:
        return None
    B = []
    for i in range(len(A)):
        if len(B) < k:
            first = A[i]
            if i == len(A) - 1:
                last = n
            else:
                last = A[i+1]
            B.append(s[first:last])
            if len(B) == k:
                B[-1] += (s[last:])
    return B

def main():
    k = int(input())
    s = input()
    ans = solve(s, k)
    if ans:
        print('YES')
        for a in ans:
            print(a)
    else:
        print('NO')

if __name__ == "__main__":
    main()
