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.io.PrintStream;
import java.util.StringTokenizer;

/**
 * 44E
 *
 * A greedy solution.
 *
 * O(len(s)) time
 * O(len(s)) space
 *
 * @author artyom
 */
public class AnfisaTheMonkey implements Runnable {
    private BufferedReader in;
    private PrintStream out;
    private StringTokenizer tok;

    private void solve() throws IOException {
        int k = nextInt(), a = nextInt(), b = nextInt();
        char[] s = nextToken().toCharArray();
        int l = s.length / k, rem = s.length % k, u = l;
        if (rem > 0) {
            u++;
        }
        if (a > l || b < u) {
            out.print("No solution");
            return;
        }
        StringBuilder sb = new StringBuilder();
        int p = 0;
        for (int i = 0; i < rem; i++) {
            for (int j = p, n = p + u; j < n; j++) {
                sb.append(s[j]);
            }
            sb.append('\n');
            p += u;
        }
        for (int i = rem; i < k; i++) {
            for (int j = p, n = p + l; j < n; j++) {
                sb.append(s[j]);
            }
            sb.append('\n');
            p += l;
        }
        out.print(sb);
    }

    //--------------------------------------------------------------
    public static void main(String[] args) {
        new AnfisaTheMonkey().run();
    }

    @Override
    public void run() {
        try {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = System.out;
            tok = null;
            solve();
            in.close();
        } catch (IOException e) {
            System.exit(0);
        }
    }

    private String nextToken() throws IOException {
        while (tok == null || !tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    private int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    private int[] readIntArray(int n) throws IOException {
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = nextInt();
        }
        return arr;
    }
}