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.

Input

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.

Output

Print k lines, each of which contains no less than a and no more than b symbols — Anfisa's text divided into lines. It is not allowed to perform any changes in the text, such as: deleting or adding symbols, changing their order, etc. If the solution is not unique, print any of them. If there is no solution, print "No solution" (without quotes). 

Examples

Input

3 2 5
abrakadabra


Output

ab
rakad
abra


Input

4 1 2
abrakadabra


Output

No solution
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 = r // (k - 1)
        m = r % (k - 1)
        for i in range(k - 1):
            d[i] += q
            if i + 1 <= m:
                d[i] += 1
    for item in d:
        print(s[:item])
        s = s[item:]
