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 code44E {
	public static void main(String[] args) throws Exception{
		BufferedReader bff=new BufferedReader(new InputStreamReader(System.in));
		PrintWriter wff=new PrintWriter(System.out);
		String[] st=bff.readLine().split(" ");
		int k=Integer.parseInt(st[0]);
		int a=Integer.parseInt(st[1]);
		int b=Integer.parseInt(st[2]);
		String cad=bff.readLine();
		boolean no=true;
		int n=cad.length();
		if( a*k <= n && n <= b*k );
	    else{ wff.println("No solution"); no=false;}

		if(no){
			int m = n/k; int d = n%k;
			
			int si = 0;
			for(int ki = 0; ki < k; ki++)
			{
				int p;
				if( ki < d ) p = m+si+1;
				else p = m+si;
				
				while( si < p ) wff.printf("%c", cad.charAt(si++));
				wff.println();
			}
		}
		wff.flush();
		//porquenoactualizaa2oj
	}
}
