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())
st = input()

if len(st) < k*a:
    print("No solution")
elif len(st) > k*b:
    print("No solution")
else:
    check = []
    hasSolution = True
    
    for _ in range(k):
        check.append(a)
        
    size = len(st) - k*a
    rem = size//k
    
    for i in range(k):
        check[i] += rem
    
    size -= rem*k
    
    if size != 0:
        ctd = 0
        while size != 0:
            check[ctd] += 1
            size -= 1
        
        hasSolution = True
        for i in range(k):
            if check[i] > b:
                print("No solution")
                hasSolution = False
    
    if hasSolution:
        ini,end = 0,check[0]
        for i in range(k):
            print(st[ini:end])
            ini = end
            
            if i+1 != k: 
                end += check[i+1]
   	   				 		 	 	 		 		 				