CodeForces 544A

You are given a string q. A sequence of k strings s₁, s₂, ..., s_k is called beautiful, if the concatenation of these strings is string q (formally, s₁ + s₂ + ... + s_k = 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.

Input

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.

Output

If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next k lines print the beautiful sequence of strings s₁, s₂, ..., s_k.

If there are multiple possible answers, print any of them.

Sample test(s)

Input

1
abca

Output

YES
abca

Input

2
aaacas

Output

YES
aaa
cas

Input

4
abc

Output

NO

Note

In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.

做简单题目，慢慢来，想快点，写好点

#include <cstring>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;

int main()
{
    //freopen("in.txt", "r", stdin);
    int nstr;

    while(scanf("%d", &nstr) != EOF)
    {
        getchar();
        char str[105];
        bool vis[105];
        gets(str);
        int len = strlen(str);
        memset(vis, false, sizeof(vis));

        set<char> s;

        int p = 0;
        s.insert(str[0]);
        ++p;
        vis[0] = true;
        if(p != nstr)
        {
            for(int i = 1; i != len; ++i)
            {
                if(s.find(str[i]) == s.end() && p < nstr)
                {
                    s.insert(str[i]);
                    ++p;
                    vis[i] = true;
                }
            }
        }

        if(p < nstr)
        {
            cout << "NO" << endl;
        }
        else
        {
            cout << "YES" << endl;
            for(int i = 0; i != len; ++i)
            {
                if(vis[i] == true)
                {
                    putchar(str[i]);
                    int j = i+1;
                    while(vis[j] == false && j < len)
                    {
                        putchar(str[j]);
                        ++j;
                    }
                    puts("");
                }
            }
        }
    }
    return 0;
}