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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class ansifa {
    public static void main(String args[]) throws IOException {
        process();
    }
    public static void process() throws IOException{
        BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer(in.readLine()," ");
        float k=Long.parseLong(st.nextToken());
        int a=Integer.parseInt(st.nextToken());
        int b=Integer.parseInt(st.nextToken());
        String arr=in.readLine();
        int n=arr.length();
        int j=(int)Math.ceil(n/k);
        int u=(int)(n/k);
        if(u==0)
            System.out.println("No solution");
        else if(j<a || j>b)
            System.out.println("No solution");
        else if(u<a || u>b)
            System.out.println("No solution");
        else{
            j=(int)(n/k);
            for(int i=0;i<k;i++){
                if(i==k-1){
                    System.out.println(arr);
                    break;
                }
                if(arr.length()<j) {
                    System.out.println(arr);
                    break;
                }
                System.out.println(arr.substring(0,j));
                arr=arr.substring(j);
            }
        }
    }
}
