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.

Input

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.

Output

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). 

Examples

Input

3 2 5
abrakadabra


Output

ab
rakad
abra


Input

4 1 2
abrakadabra


Output

No solution
#!/usr/bin/python
import sys

(k, a, b) = map(lambda(x):int(x), sys.stdin.readline().split())
s = sys.stdin.readline().strip()
l = len(s)
if l < k * a or l > k * b:
	print "No solution"
	sys.exit(0)

if a == b:
	for i in range(k):
		print s[i*a:(i+1)*a]
	sys.exit(0)

na = (k*b-l) // (b-a)
nb = k - na
if (k*b-l) % (b-a) != 0:
	nb -= 1
for i in range(na):
	print s[i*a:(i+1)*a]
for i in range(nb):
	print s[na*a+i*b: na*a+(i+1)*b]
if (na*a+nb*b) < l: 
	print s[na*a+nb*b:]
