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 sys
from math import *

def minp():
	return sys.stdin.readline().strip()

def mint():
	return int(minp())

def mints():
	return map(int, minp().split())

k, a, b = mints()
v = [b]*k
s = minp()
n = len(s)
m = b*k
i = 0
if m < n:
	print("No solution")
while m > n and i < k:
	m += a-b
	v[i] = a
	i += 1
if m > n:
	print("No solution")
else:
	if i < k:
		v[i-1] += n-m
	z = 0
	for i in range(k):
		print(s[z:z+v[i]])
		z+=v[i]
