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 E {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		k = s.nextInt();
		a = s.nextInt();
		b = s.nextInt();
		str = s.next();
		list = new ArrayDeque<Integer>();
		f(0);
		System.out.println("No solution");
	}

	static String str;
	static Deque<Integer> list;
	static int a, b, k;

	static void f(int sum) {
		int x = k - list.size(), y = sum - str.length();
		if (x == 0 && y == 0) {
			int j = 0;
			java.io.PrintWriter pw = new java.io.PrintWriter(System.out);
			for (int next : list) {
				pw.println(str.substring(j, j + next));
				j += next;
			}
			pw.close();
			System.exit(0);
		} else if (x > 0 && b * x + y >= 0 && a * x + y <= 0) {
			for (int i = a; i <= b; ++i) {
				if (sum + i > str.length()) {
					break;
				}
				list.push(i);
				f(sum + i);
				list.pop();
			}
		}
	}
}
