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)
d = [[-1]*(k+1) for  _ in range(n+1)]
def dp(n, k):
    if d[n][k] != -1:
        return d[n][k]
    if k==0:
        if n==0:
            return (True, [])
        else:
            return (False, [])
    else:
        if n<=0:
            return (False, [])
    ans = []
    found = False
    for i in range(a, b+1):
        flag, l = dp(n-i, k-1)
        d[n-i][k-1] = (flag, l)
        if flag:
            found = True
            ans = [i]+l
            break
    d[n][k] = (found, ans)
    return d[n][k]

flag , ans = dp(n, k)
if flag:
    i = 0
    for x in ans:
        print(s[i:i+x])
        i += x
else:
    print("No solution")
