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.
import math
k, a, b = map(int, input().split())
string = str(input())
n = len(string)
minimum = n / b
maximum = n / a
if k < minimum :
    print("No solution")
else :
    letterPerLine = math.floor(n / k)
    l = 0
    while k > 1 :
        
        if l + letterPerLine < n :
            print(string[l : l + letterPerLine])
            l += letterPerLine
            
        k -= 1
    remLetter = n - l
    print(string[-remLetter :])
    
    