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.lang.*;
import java.util.*;
import java.util.stream.Collectors;
import java.io.*;

public class Bit_year {
	
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		int k = sc.nextInt();
		int a = sc.nextInt();
		int b = sc.nextInt();
		String s = sc.next();
		int n = s.length();
		if(n < k*a || n >k*b)System.out.println("No solution");
		else
		{
			String[] temp = new String[k];
			int[] size = new int[k];
			int left = n - k*a;
			int i=0;
			Arrays.fill(size, a);
			while(i<k && left>0)
			{
				size[i]+=  Math.min(left , (b-a));
				left-=(b-a);
				i++;
			}
			int j=0;
			for(i=0;i<k && j<n;i++)
			{
				temp[i]=s.substring(j,j+size[i]);
				j+=size[i];
			}
			
			for(i=0;i<k;i++)System.out.println(temp[i]);
		}
	}
}