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

k_lines, min_length, max_length = [int(x) for x in sys.stdin.readline().split()]
line = sys.stdin.readline().strip()
mem = set()

def split_str(string, n_lines, sol=[]):
    if (string, n_lines) in mem:
        return
    mem.add((string, n_lines))
    if string == "" and n_lines == 0:
        for l in sol:
            print(l)
        sys.exit(0)
        return
    if n_lines == 0:
        return
    if len(string) < min_length:
        return

    for i in range(min_length, max_length+1):
        cut_out, rest = string[0:i], string[i:]
        split_str(rest, n_lines-1, sol+[cut_out])

split_str(line, k_lines)
print("No solution")
