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

//School Team Contest #2 (Winter Computer School 2010/11), E
public class AnfisaTheMonkey {

    public static void main(String[] args) throws IOException {
		//System.setIn(new FileInputStream("/home/kite/input.txt"));
		BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
		String ss[] = r.readLine().split("\\s+");
		int k = Integer.parseInt(ss[0]);
		int a = Integer.parseInt(ss[1]);
		int b = Integer.parseInt(ss[2]);
		assert a < b;
		String s = r.readLine();
		int l = s.length();
		if(l < k * a || l > k * b) {
			System.out.println("No solution");
			return;
		}
		int avg = l / k;
		int result[] = new int[k];
		for(int i = 0; i < k - 1; i++)
			result[i] = avg;
		result[k - 1] = l - avg * (k - 1);
		for(int i = k - 2; result[k - 1] > b; i--) {
			result[i]++;
			result[k - 1]--;
		}
		for(int i = 0, j = 0; i < k; i++)
			System.out.println(s.substring(j, j += result[i]));
    }

}
