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
"""
3 2 5
abrakadabra

"""

import sys

k, a, b = map(int, sys.stdin.readline().split())

s = raw_input()
n = len(s)

dp = [[None for i in range(b+1)] for j in range(k)]

for i in range(a, min(b+1, n+1)):
    dp[0][i] = (-256, i)

for i in range(1, k):

    for j in range(a, b+1):

        for t in range(a, b+1):

            if dp[i-1][t] != None:

                delS = n - (dp[i-1][t][1]+j)

                if delS >= (k-1-i)*a and delS <= (k-1-i)*b:

                    dp[i][j] = (t, dp[i-1][t][1]+j)
                    break
        

soln = []

start = -256

for j in range(a, b+1):

    if dp[k-1][j] != None:
        start = dp[k-1][j][0]
        soln.append(start)
        break

if start == -256:
    print 'No solution'
    exit(0)

for i in range(k-1, -1, -1):

    soln.append(dp[i][start][0])
    start = dp[i][start][0]

ANS = []
pt = 0
for i in soln:
    S = []
    for j in range(i):
        S.append(s[pt])
        pt += 1
    S = ''.join(S)
    ANS.append(S)

ANS = '\n'.join(ANS)
print ANS
######
