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()

L = ( len( S ) + B - 1 ) // B
R = ( len( S ) + A - 1 ) // A

if not ( L <= K and K <= R ):
  exit( print( "No solution" ) )

ans = []
ptr = 0
while ptr < len( S ):
  nxt = ptr + A
  while K - ( len( ans ) + 1 ) < ( len( S ) - nxt + B - 1 ) // B:
    nxt += 1
  ans.append( S[ ptr : nxt ] )
  ptr = nxt

print( '\n'.join( ans ) )
