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())
q=input()
w=len(q)
p=k
i=0
e=b-a
w-=k*a
if w<0:
    print('No solution')
    exit()
elif w>0 and e==0:
    print('No solution')
    exit()
if w%e==0:
    r=w//e
    if r>k:
        print('No solution')
        exit()
    else:
        while p:
            if r>0:
                print(q[i:(i+b)])
                i+=b
                r-=1
            else:
                print(q[i:(i+a)])
                i+=a
            p-=1
else:
    r=w//e
    if (r+1)>k:
        print('No solution')
        exit()
    else:
        while p-1:
            if r>0:
                print(q[i:(i+b)])
                i+=b
                r-=1
            else:
                print(q[i:(i+a)])
                i+=a
            p-=1
        print(q[i::])