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 sys import stdin


def solution():
    input = stdin.readline
    k, a, b = map(int, input().split())
    s = input().rstrip()

    n = len(s)
    minn = k * a
    maxx = k * b

    if minn <= n <= maxx:
        diff1 = n - minn
        diff2 = b - a
        try:
            l1 = diff1 // diff2
        except:
            l1 = 0
        m = n - minn - (diff2 * l1)
        j = 0

        for i in range(k):
            if l1:
                print(s[j:j + b])
                l1 -= 1
                j += b
            elif m:
                print(s[j:j + a + m])
                j = j + a + m
                m = 0
            else:
                print(s[j:j + a])
                j += a
    else:
        print("No solution")


if __name__ == "__main__":
    solution()
