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.
#I can divide the total number o chars by the numbers of a -> b and split with one that I can split 
#everything in k lines, if I can't I just print "No solution"
k, a, b = map(int, input().split())
chars = input()
for splitNum in range(a,b+1):
    parts = len(chars)/splitNum
    if(parts <= k and parts >= k - 1):
        splited = [chars[i:i+splitNum] for i in range(0, len(chars), splitNum)]
        for line in splited:
            print(line)
        exit()
print("No solution")
 	  			 			 				     		 		 		 	