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

bckt = ["" for i in range(k)]

if k*a > len(s) or k*b < len(s):
    print("No solution")
else:
    ct = [0]*k
    for i in range(k):
        ct[i] += a
        
    rem = len(s) - k*a
    for i in range(k):
        q = min(rem, b-a)
        ct[i] += q
        rem -= q
        
    for i in range(k):
        bckt[i] += s[:ct[i]]
        s = s[ct[i]:]
        
    for i in bckt:
        print(i)