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.

Input

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.

Output

Print k lines, each of which contains no less than a and no more than b symbols — Anfisa's text divided into lines. It is not allowed to perform any changes in the text, such as: deleting or adding symbols, changing their order, etc. If the solution is not unique, print any of them. If there is no solution, print "No solution" (without quotes). 

Examples

Input

3 2 5
abrakadabra


Output

ab
rakad
abra


Input

4 1 2
abrakadabra


Output

No solution
import java.util.*;
public class b
{
    static int mod = (int) 1e9 + 7;
    static int Infinity=Integer.MAX_VALUE;
    static int negInfinity=Integer.MIN_VALUE;
    public static void main(String args[])
    {
        Scanner d= new Scanner(System.in);
        int k,a,l,b,i,w;
        k=d.nextInt();
        a=d.nextInt();
        b=d.nextInt();
        d.nextLine();
        String s=d.nextLine();
        l=s.length();
        w=0;
        if(k*a>l || k*b<l)
        System.out.println("No solution");
        else
        {
            int q[]=new int[k];
            for(i=0;i<k;i++)
            q[i]=a;
            l-=a*k;
            i=0;
            while(l>0)
            {
                q[i]++;
                l--;
                i++;
                if(i==k)
                i=0;
            }
            for(i=0;i<k;i++)
            {
                while(q[i]>0)
                {
                    System.out.print(s.charAt(w));
                    q[i]--;
                    w++;
                }
                System.out.println();
            }
        }
    }
}
