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.
from math import floor

k, a, b = map(int, input().split())
s = input()
n = len(s)
if not k * a <= n <= k * b:
    print("No solution")
else:
    d = [a] * (k - 1)
    d.append(n - sum(d))
    if d[-1] > b:
        r = d[-1] - b
        d[-1] = b
        q = floor(r / (k - 1))
        for i in range(k - 1):
            d[i] += q
        d[-2] += r - ((k - 1) * q)
    for item in d:
        print(s[:item])
        s = s[item:]
