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

public class A {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder sb = new StringBuilder();

        int k = sc.nextInt();
        int a = sc.nextInt();
        int b = sc.nextInt();

        String str = sc.next();
        char c[] = str.toCharArray();

        int n = c.length;

        if (k > (n) / a || k < (n + b - 1) / b) {
            System.out.println("No solution");
            return;
        }

        int index = 0;

        while (k != 0) {

            k--;

            String s = "";
            s = s + c[index];

            index++;

            while (k > (n - index) / a || k < (n - index + b - 1) / b || s.length() < a) {
                s = s + c[index];
                index++;
            }

            sb.append(s).append("\n");

        }

        System.out.print(sb);
    }
}