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())
t=list(input());l=len(t)
d=abs(a-b)
fin=[max(a,b)*k-i*d for i in range(1+k)]
if l not in fin:
    print("No solution")
else:
    for i in range(len(fin)):
        if fin[i]==l:
            for j in range(i):
                print("".join(t[:min(a,b)]))
                del t[:min(a,b)]
            for j in range(len(fin)-i):
                print("".join(t[:max(a,b)]))
                del t[:max(a,b)]