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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class AnfisaTheMonkey {
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
		String s=r.readLine();
		String[] sp=s.split(" ");
		int k=new Integer(sp[0]);
		int a=new Integer(sp[1]);
		int b=new Integer(sp[2]);
		s=r.readLine();
		int n=s.length();
		if(n>=a*k&&n<=b*k){
			int div=n/k;
			int mod=n%k;
			int curr=0;
			for(int i=0;i<mod;i++){
			
				System.out.println(s.substring(curr,curr+div+1));
				curr+=div+1;
			}
			for(int i=mod;i<k;i++){
				System.out.println(s.substring(curr,curr+div));
				curr+=div;
			}
		}
		else{
			System.out.println("No solution");
		}
	}
}
