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.
k, a, b = map(int, input().split())
s = input()
sLength = len(s)
if(sLength>k*b or sLength<k*a):
  print("No solution")
else:
  vet = [int(sLength/k)] * k
  max = vet[0]
  vetSum = sum(vet)
  if(vetSum<sLength):
    i = 0
    while(vetSum<sLength and max<=b):
      vet[i]+=1
      vetSum +=1
      if(i==0):
        max+=1
      i+=1
      if(i>=sLength):
        i=0
  else:
    i = 0
    while(vetSum>sLength and max>=a):
      vet[i]+=1
      vetSum -=1
      if(i==0):
        max-=1
      i+=1
      if(i>=sLength):
        i=0
  if(vetSum==sLength):
    # print("dá")
    # print(vet)
    # print("s: ", s)
    i = 0
    for j in vet:
      print(s[i:j+i])
      i+=j
  else:
    print("No solution")

 					    	 		 		  	  	  		 		