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()
lent=len(s)
if lent>(k*b) or lent<(k*a):
    print("No solution")
else:
    dp=[a]*k
    rem=lent-(sum(dp))
    i=0
    while rem>0:
        dp[i]+=1
        i=(i+1)%k
        rem-=1
    pref=[0]*(k+1)
    pref[1]=dp[0]
    for i in range(1,k+1):
        pref[i]=pref[i-1]+dp[i-1]
    for i in range(1,k+1):
        print(s[pref[i-1]:pref[i]])


