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 , n , m = map(int,input().split())
s = input()
l = len(s)
if l>k*m or l<n*k:
    print("No solution")
    exit()
lis=[n]*k
l-=((n)*(k))
c=0
ans=[]
while l!=0:
    for j in range(k):
        if l==0:
            break        
        if lis[j]<m:
            lis[j]+=1
            l-=1
#    print(lis,l)        
    if l==0:
        break
c=0  
#print(lis)      
for j in range(k):
    ss=s[c:lis[j]+c]
    ans.append(ss)
    c+=lis[j]
#print(ans)
for i in ans:
    print(*i,sep='')