CF44E.Anfisa the Monkey

Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k lines not shorter than a and not longer than b, for the text to resemble human speech more. Help Anfisa.

猴子安菲萨正在学习打字。她还不熟悉“空格”键，只能输入小写拉丁字母。在连续输入了相当长的一行文字后，安菲萨意识到：若将所写内容划分为 $k$ 行，且每行长度不小于 $a$、不大于 $b$，则文本会更接近人类语言的表达方式。请帮助安菲萨完成这一划分。

The first line contains three integers k, a and b (1 ≤ k ≤ 200, 1 ≤ a ≤ b ≤ 200). The second line contains a sequence of lowercase Latin letters — the text typed by Anfisa. It is guaranteed that the given line is not empty and its length does not exceed 200 symbols.

第一行包含三个整数 $k$、$a$ 和 $b$（$1 ≤ k ≤ 200$，$1 ≤ a ≤ b ≤ 200$）。第二行包含一串小写拉丁字母——Anfisa 输入的文本。保证该行非空，且长度不超过 200 个字符。

Print k lines, each of which contains no less than a and no more than b symbols — Anfisa's text divided into lines. It is not allowed to perform any changes in the text, such as: deleting or adding symbols, changing their order, etc. If the solution is not unique, print any of them. If there is no solution, print "No solution" (without quotes).

输出 k 行，每行包含不少于 a 个且不多于 b 个字符——即安菲萨的文本被划分成的行。不允许对文本进行任何修改，例如：删除或添加字符、改变字符顺序等。若解不唯一，输出任意一个解即可；若无解，则输出 "No solution"（不含引号）。