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 static java.util.Arrays.deepToString;

import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) throws IOException {
        Scanner s = new Scanner(System.in);
        while(s.hasNext()){
            int k = s.nextInt(), a = s.nextInt(), b = s.nextInt();
            String z = s.next();
            int l = z.length();
            boolean ok = true;
            if (k * b < l || k * a > l){
                ok = false;
            }
            int[] x = new int[k];
            int av = l / k;
            int remain = l % k;
            for(int i=0;i<x.length;i++){
                x[i] = av;
            }
            int cn = 0;
            for(int i=0;i<x.length;i++){
                if (cn < remain) {
                    x[i] ++;
                    cn++;
                }
            }
            String[] res = new String[k];
            int pre = 0;
            for(int i=0;i<res.length;i++){
                res[i] = z.substring(pre, pre + x[i]);
                pre += x[i];
            }
            if(ok) {
                for(String t : res)
                    System.out.println(t);
            }else{
                System.out.println("No solution");
            }
        }
    }
    
    void p(Object... g){
        System.out.println(deepToString(g));
    }
}