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())
string=input()
arr=[]
n=len(string)
flag=0
while k>1 and flag==0:
    if n%k==0 and a<=(n//k)<=b:
        arr.append(n//k)
        n-=(n//k)
        k-=1
    elif n%k!=0 and a<=((n//k)+1)<=b and a<=(n//k)<=b:
        arr.append(n//k)
        arr.append((n//k)+1)
        n-=((n//k)+(n//k)+1)
        k-=2
    else:
        flag=1
if k==1 and a<=n<=b:
    arr.append(n)
    k-=1
    n-=n
else:
    flag=1
if flag==0:
    i=0
    for a in arr:
        for j in range(a):
            print(string[i],end="")
            i+=1
        print("")
elif flag==1:
    print("No solution")