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.
import math
def reps(s,k,a,b):
	q = []
	x = 0
	partition = len(s)//k
	print(len(s),k,len(s)//k,partition)

	if partition < a or  partition > b:
		print('No solution')
		return

	for i in s:
		q.append(i)

	if len(s) % k == 0:
		while x < len(s):
			print(''.join(str(j) for j in q[x:x+partition]))
			x+=partition
	
	else:
		print(''.join(str(j) for j in q[:partition+1]))
		for i in range(partition+1,len(s),partition):
			print(''.join(str(j) for j in q[i:i+partition]))

k,a,b = (map(int,input().split()))
s =  input()
reps(s,k,a,b)