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.
# -*- coding: utf-8 -*-
"""
Created on Wed Mar 14 18:10:41 2018

@author: Karn
"""

k=int(input())
q=input()
tmp=k
l=len(q)
L=[]
I=[]
T=[]
if(len(set(q)) < k):
    print("NO")
else:
    print("YES")
    p=q[0]
    I.append(0)
    T.append(q[0])
    for i in range(l):
        if(q[i] not in T):
            I.append(i)
            T.append(q[i])
    
    X=[]       
    for i in range(k):
        X.append(I[i]) 
    
    for i in range(k):
        if(i==k-1):
            print(q[X[i]:])
        else:
            print(q[X[i]:X[i+1]])

                
        
        
            
    
        
    