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

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scn=new Scanner(System.in);
		String[] container=scn.nextLine().split(" ");
		int k=Integer.parseInt(container[0]);
		int a=Integer.parseInt(container[1]);
		int b=Integer.parseInt(container[2]);
		String input=scn.nextLine();
		scn.close();
		
		boolean isSolution=true;
		int count=a, len=input.length(), othercount=0;
		if(k*a>len || k*b<len)
			isSolution=false;
		else {
			for(; count<=b; count++)
				if(k*count>=len)
					break;
			
			if(k*count>len) {
				count--;
				int difference=len-k*count;
				othercount=count+difference;
				
			}
			else 
				othercount=count;
			
		    		
		}
			
		if(!isSolution)
			System.out.println("No solution");
		else {
			int startIndex=0;
			for(int i=0; i<k; i++) {
				if(i==0) {
				System.out.println(input.substring(startIndex, startIndex+othercount ));
				startIndex+=othercount;
				}
				else {
					System.out.println(input.substring(startIndex, startIndex+count ));
					startIndex+=count;
				}
					
			}
			
		}
	}

}
