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.Scanner;

public class AnfisaTheMonkey {
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int k = cin.nextInt(), a = cin.nextInt(), b = cin.nextInt();
        cin.nextLine();
        String my = cin.nextLine();
        cin.close();
        int len = my.length();
        if (b * k < len || len < k * a) {
            System.out.println("No solution");
            return;
        }
        int div = len / k;
        int mod = len % k;
        int f = 0;
        int t = div;
        for (int i = 0; i < k; i++) {
            if (mod > 0) {
                t++;
                mod--;
            }
            System.out.println(my.substring(f, t));
            f = t;
            t += div;
        }
    }
}