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.
R = lambda: map(int, input().split())
k, a, b = R()
s = input()
n = len(s)

if not k * a <= n <= k * b:
    print('No solution')
else:
    arr = [n // k] * k
    rem = n % k
    i = 0
    while rem:
        arr[i] += 1
        rem -= 1
        i = (i + 1) % k
    st = 0
    for l in arr:
        print(s[st: st + l])
        st += l