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()
length = len(s)
if length < a*k or length > b*k:
    print("No solution")
    quit()
parts=[a]*k
length -= a*k
cur=0
while length > 0:
    if length < b-a:
        parts[cur] += length
        length = 0
    else:
        parts[cur] += b-a
        length -= (b-a)
    cur += 1
for part in parts:
    print(s[:part])
    s = s[part:]