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().strip()

n=len(s)
if a*k>n or b*k<n:
    print("No solution")
else:
    x=[a]*k
    n-=k*a
    i=0
    while (n>0):
        x[i]+=min(n,b-a)
        n-=min(n,b-a)
        i+=1
    i=0
    c=0
    while (i<len(s)):
        print(s[i:i+x[c]])
        i+=x[c]
        c+=1