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.io.*;
import java.util.*;

public class Main 
{
    public static void main ( String[] args ) throws IOException
    {
        Scanner in=new Scanner(System.in);
        PrintWriter out=new PrintWriter(System.out);
        int k=in.nextInt(),a=in.nextInt(),b=in.nextInt();
        String text=in.next();
        int len=text.length();
        int[][] p=new int[len+1][k+1];
        p[0][0]=-1;
        for (int i=1;i<=len;++i)
            for (int j=1;j<=k;++j)
                if (p[i][j]==0)
                    for (int t=a;t<=Math.min(b, i);++t)
                        if (p[i-t][j-1]!=0)
                            p[i][j]=i-t+1;
        if (p[len][k]==0)
            out.print("No solution");
        else
        {
            Stack S=new Stack();
            int pos=len;
            for (int i=k;i>0;--i)
            {
                S.push(pos);
                pos=p[pos][i]-1;
            }
            pos=0;
            while (!S.empty())
            {
                int ppos=(int)S.peek();
                S.pop();
                out.println(text.substring(pos, ppos));
                pos=ppos;
            }
        }
        out.close();
    }
}


