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

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

	for i in s:
		q.append(i)

	while x < len(s):
		print(*q[x:x+partition])
		x+=partition


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



