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,a,b= map(int,input().split())
s= input ()
l = len(s) - a
r = len(s) - 1
ck = {l:len(s)-1}
while (l > 0):
    l-=1
    if (r-l +1 >= a and r-l+1 <= b) :
        ck[l]= r
    elif (r-l +1  > b):
        for i in range(r,l-1,-1):
            if (i-l+1 >= a and i-l+1 <=b) and i+1 in ck.keys():
                r = i;
                ck[l] = r
                break
        if r-l+1 > b :
            print ("NO SOLUTION")
            break
if 0 in ck.keys() :
    l=0
    while l in ck.keys():
         print (s[l:ck[l]+1])
         l = ck [l]+1
else :
    print ("NO SOLUTION")
print (ck)