You are given a string q . A sequence of k strings s 1, s 2, ..., s k is called beautiful, if the concatenation of these strings is string q (formally, s 1 + s 2 + ... + 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.
输入描述:
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.
输出描述:
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 s1, s2, ..., sk.If there are multiple possible answers, print any of them.
示例1
输入
1<br />abca<br />2<br />aaacas<br />4<br />abc<br />
输出
YES<br />abca<br />YES<br />aaa<br />cas<br />NO<br />
备注:
In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.
加载中...