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,a,b = map(int, sys.stdin.readline().split(' '))
text  = sys.stdin.readline().strip()
if (len(text) > k*b) or (len(text) < k*a):
    print 'No solution'
else:
    p   = 0
    remc = len(text) 
    rl   = k 
    for i in xrange(k):
        rl   -=1
        for j in xrange(a,b+1):
            if remc <= rl*b + j and remc  >= rl*a +j:
                nw = j
                break
        e = p+nw
        if e > len(text):
            e=len(text)
        print '%s' % text[p:e]
        remc -= nw
        p += nw

