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.*;
import java.io.*;

public class B{
	public static void main(String[] args)
	{
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		int k = fs.nextInt(); int a = fs.nextInt(); int b = fs.nextInt();
		char[] arr = fs.next().toCharArray();
		int len = arr.length;
		if(k*a>len || k*b<len)
		{
			out.println("No solution");
			out.close();
			return;
		}
		//how much extra 
		int extra = len-a*k;
		int pos = 0;
//		out.println(extra);
		for(int i=0;i<k;i++)
		{
			int j = pos;
			int max = pos+b-1;
			for(;j<pos+a;j++)
			{
				out.print(arr[j]);
			}
			int my = max-j+1;
			int mo = Math.max(0,Math.min(extra,my));
			for(int c=0;c<mo;c++)
			{
				out.print(arr[j]);
				j++;
			}
			out.println();
			extra = Math.max(0,extra-mo);
			pos = j;
		}
		out.close();
	}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}


