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.
def solution():
    def solve(k,a,b,s):
        if len(s) < a * k or len(s) > b * k:
            print("No solution")
            return
        j = [i for i in range(k)]
        n = len(s)
        n -= k * a
        for i in range(k-1, -1, -1):
            if n <= b - a:
                j[i] += n
                break
            else:
                j[i] = b
                n += a
                n -= b
        v = 0
        for i in range(k):
            print(s[v:v+j[i]])
            v += j[i]
        return
    k,a,b = [int(x) for x in input().split()]
    s = int(input())
    solve(k,a,b,s)
solution()
#[int(x) for x in input().split()]
	 		  		 	    		 	 	  			 	