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.
nr,mini,maxi =list(map(int,input().split(" ")))
line,current,curr,thesum = input(),0,0,nr*mini
if len(line) < nr*mini or len(line) > nr*maxi: print("No solution")
else:
	array = [mini for x in range(nr)]
	while thesum < len(line):
		if array[curr] == maxi: curr+=1
		array[curr],thesum =array[curr]+1, thesum+1
	print(array)
	for x in array:
		print(line[current:current+x])
		current+=x