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
//package codeforces;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 * https://codeforces.com/problemset/problem/44/E
 */
public class AnfisaTheMonkey {


	private static int k, a, b;
	private static String s;
	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);

		k = in.nextInt();
		a = in.nextInt();
		b = in.nextInt();
		in.nextLine();
		s = in.nextLine();

		boolean[][] f = new boolean[k + 1][s.length() + 1];
		int[][] ans = new int[k + 1][s.length() + 1];
		f[0][0] = true;

		for (int i = 1; i <= k; i++) {
			for (int j = 0; j <= s.length(); j++) {
				for (int k = a; k <= b; k++) {
					if (k > j) {
						break;
					}
					if (f[i - 1][j - k]) {
						ans[i][j] = k;
						f[i][j] = true;
						break;
					}
				}
			}
		}

		if (!f[k][s.length()]) {
			System.out.println("No solution");
		} else {
			int c = k;
			int l = s.length();
			List<Integer> list = new ArrayList<>();
			while (c > 0) {
				list.add(ans[c][l]);
				l -= ans[c][l];
				c--;
			}
			for (int i = list.size() - 1; i >= 0; i--) {
				System.out.println(s.substring(0, list.get(i)));
				s = s.substring(list.get(i));
			}
		}

		in.close();
	}
}
