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.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class E {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

		int n = in.nextInt();
		int l = in.nextInt();
		int r = in.nextInt();
		in.nextLine();
		String str = in.nextLine();

		int minS = l * n;
		int maxS = r * n;
		if (minS > str.length() || maxS < str.length()) {
			out.print("No solution");
		} else {
			int ans[] = new int[n];
			for (int i = 0; i < n; i++) {
				ans[i] = l;
			}
			int len = str.length();
			int sum = l * n;
			while (sum < len) {
				for (int i = 0; i < n && sum < len; i++) {
					ans[i]++;
					sum++;
				}
			}

			int s = 0;
			for (int i = 0; i < n; i++) {
				out.println(str.substring(s, s+ans[i]));
				s += ans[i];
			}
		}

		out.close();
		in.close();
	}
}
