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)
one = n//k
if n % k == 0:
    if b >= one >= a:
        for i in range(0, n, one):
            print(s[i:i+one])
    else:
        print("No solution")
else:
    if b >= one+1 and one >= a:
        ost = n%k
        post = 0
        for i in range(0, n, one):
            if ost > 0:
                print(s[i+post:i+one+1+post])
                ost -= 1
                post += 1
            else:
                print(s[i+post:i+one+post])
    else:
        print("No solution")