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,l,r=[int(x) for x in input().split()]
s=input()
n=len(s)
if n//r>k:
    print("No solution")
    exit()
ans=rem=0
for i in range(l,r+1):
    if n%i==0 and n==k*i:
        ans=i
        break
    if n%i:
        if n//i==k-1 and n%i>=l:
            ans=i
            rem=n%i
            a=[ans]*k-1
            a=a+(n%i)
            idx=0
            v=[]
            for i in range(k):
                v.append(s[idx:idx+a[i]])
                idx+=a[i]
            for i in range(k):
                if len(v[i])>=l and len(v[i])<=r:
                    continue
                else:
                    f=1
            if f:
                print("No solution")
                exit()
            else:
                for i in range(k):
                    print(v[i])
                exit()
        if n//i==k and n%i<=k:
            ans=i
            rem=n%i
            break
            
if ans==0:
    n-=((k-1)*l)
    a=[l]*k
    a[k-1]=r
    n-=r
    for i in range(k):
        if n:
            a[i]+=1
            n-=1
        else:
            break

else:
    a=[ans]*k
    for i in range(k):
        if rem:
            a[i]+=1
            rem-=1
        else:
            break

#print(ans)
f=0

idx=0
v=[]
for i in range(k):
    v.append(s[idx:idx+a[i]])
    idx+=a[i]
for i in range(k):
    if len(v[i])>=l and len(v[i])<=r:
        continue
    else:
        f=1
if f:
    print("No solution")
else:
    for i in range(k):
        print(v[i])
        