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 solve():
    linha = list(map(int, input().split()))
    palavra = input()
    tam = len(palavra)
    divisoes = linha[0];minimo = linha[1];maximo = linha[2]
    div = tam//divisoes;ini = 0;pos = 0;inicio = 0;listRes = []
    if(tam > (divisoes * maximo) ):
        print("No solution")
    elif(tam < (divisoes*minimo)):
        print("No solution")   
    else:
        while pos < (divisoes-1):
            listRes.append(palavra[inicio:inicio+div])
            inicio = inicio + div
            pos = pos+1
        listRes.append(palavra[inicio:])
        for dados in listRes:
            print(dados)
   
solve()
	 				  	  	 	 	   				  	 		