Set of Strings

1000ms

262144K

Description:

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 Input:

1
abca

Sample Output:

YES
abca

Sample Input:

2
aaacas

Sample Output:

YES
aaa
cas

Sample Input:

4
abc

Sample Output:

NO

Note:

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

Informação

Provedor Codeforces

Código CF544A