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

public class P43 {
    public static void main(String[] args) throws IOException {
        BufferedReader buf = new BufferedReader(
                new InputStreamReader(System.in));
        String[] s = buf.readLine().split(" ");
        k = Integer.parseInt(s[0]) - 1;
        a = Integer.parseInt(s[1]);
        b = Integer.parseInt(s[2]);
        c = buf.readLine().toCharArray();
        dp = new int[k + 1][c.length][c.length];
        for (int i = 0; i < dp.length; i++)
            for (int j = 0; j < dp[0].length; j++)
                Arrays.fill(dp[i][j], -1);
        best = new int[dp.length][dp[0].length][dp[0][0].length];
        int ans = go(0, 0, 0);
        if (ans == 0)
            System.out.println("No solution");
        else {
            String ss = new String(c);
            int index = 0;
            int line = 0;
            int last = 0;
            while (index != c.length) {
                if (best[line][index][last] == 1) {
                    System.out.println(ss.substring(last, index));
                    line++;
                    index++;
                    last = index - 1;
                } else {
                    index++;
                }
            }
            System.out.println(ss.substring(last, index));
        }

    }

    static int k;
    static int a;
    static int b;
    static int[][][] dp;
    static int[][][] best;
    static char[] c;

    private static int go(int line, int index, int last) {
        if (line == k && (c.length - last) >= a && (c.length - last) <= b)
            return 1;
        else if (line == k || (index - last) > b || index == c.length)
            return 0;
        else if (dp[line][index][last] != -1)
            return dp[line][index][last];
        else {
            int x = (index - last >= a) ? go(line + 1, index + 1, index) : 0;
            int y = go(line, index + 1, last);
            if (x == 1) {
                best[line][index][last] = 1;
            } else if (y == 1) {
                best[line][index][last] = 2;
            }
            return dp[line][index][last] = Math.max(x, y);
        }
    }
}
