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
from sys import stdin, stdout

def main():
    k, a, b = [int(x) for x in stdin.readline().rstrip().split()]
    s = stdin.readline().rstrip()
    n = len(s)
    b = min(b, n)
    
    if a > n:
        print('No solution')
        sys.exit(0)

    table = [[-1] * n for _ in range(k)]
    for w in range(a - 1, b):
        table[0][w] = 0

    for i in range(1, k):
        for j in range(n):
            for w in range(a - 1, b):
                if j - w - 1 >= 0 and table[i - 1][j - w - 1] >= 0:
                    table[i][j] = j - w

    if table[-1][-1] > -1:
        i, j = k - 1, n - 1
        out = []
        while i >= 0:
            if table[i][j] >= 0:
                out.append(s[table[i][j]:j + 1])
                j = table[i][j]
                i -= 1
            j -= 1
        out = out[::-1]
        for o in out:
            print(o)
    else:
        print('No solution')



if __name__ == '__main__':
    main()
