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.
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.
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=[]
for i in range(k):
    for j in range(k):
        if lis[j]<m:
            lis[j]+=1
            l-=1
        if l==0:
            break
    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,sep="\n")                        
