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.
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.

k,a,b = map(int,input().split())
qo =  input()


 
def find(word,a,b):
    rs = len(word)

    cs = rs/k

    if cs < a or cs > b:
        print("No solution")
        exit(0)
 
    for i in range(k):
        length = len(word)
        index = round(length/(k-i))

        print(word[:index])
        word = word[index:]
find(qo,a,b)
