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

MAXN = 202

was = [[False for i in range(MAXN)] for j in range(MAXN)]
prev = [[None for i in range(MAXN)] for j in range(MAXN)]

was[0][0] = True

for sz in range(n):
    for num_div in range(sz + 1):
        if was[sz][num_div] is False:
            continue
        for next_len in range(a, b + 1):
            if sz + next_len > n:
                break
            was[sz + next_len][num_div + 1] = True
            prev[sz + next_len][num_div + 1] = next_len


if not was[n][k]:
    print('No solution')
else:
    res = []
    while k > 0:
        sz = prev[n][k]
        res.append(s[n - sz:n])
        k -= 1
        n -= sz
    print('\n'.join(res[::-1]))


