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
k,a,b=map(int,input().split())
s=input()
if a>b:
    a,b=b,a
if len(s)>b*k or len(s)<a*k:
    print('No solution')
    exit() 
s1=[a]*k 
rem=len(s)-a*k 
for i in range(k):
    if rem==0: break
    if rem>=b-a:
        s1[i]+=(b-a)
        rem-=(b-a)
    else:
        s1[i]+=(rem)
        rem=0 
prev=0 
#print(s1)
for i in s1:
    print(s[prev:prev+i])
    prev+=i