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
//package Contest_44;

import java.util.Scanner;

public class E {
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        int k = scanner.nextInt();
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        String s = scanner.next();
        int l = s.length();
        if(l>k*b||l<k*a){
            System.out.println("No solution");
            return;
        }
        if(a==b){
            if(a*k!=l){
                System.out.println("No solution");
                return;
            }
            StringBuilder sb = new StringBuilder();
            for(int i = 0; i < k; i++){
                sb.append(s.substring(i*a,(i+1)*a)+"\n");
            }
            sb.deleteCharAt(sb.length()-1);
            System.out.println(sb.toString());
        }
        double d = 1.0/(a-b);
        int x = (int)Math.floor(d*(l-k*b));
        int y = (int)Math.ceil(d*(a*k-l));
        StringBuilder sb = new StringBuilder();
        for(int i = 0; i < x; i++){
            sb.append(s.substring(0,a)+"\n");
            s = s.substring(a);
        }
        for(int i = 0; i < y-1; i++){
            sb.append(s.substring(0,b)+"\n");
            s = s.substring(b);
        }
        sb.append(s);
        System.out.println(sb.toString());
    }
}
