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

public class Main {
	public static void main(String[] args)
	{
		//p_1098C();
		//p_445A();
		//p_431C();
		//p_706C();
		p_44E();
	}
	private static void p_44E()
	{
		Scanner sc = new Scanner(System.in);
		int k = sc.nextInt();
		int a = sc.nextInt();
		int b = sc.nextInt();
		sc.nextLine();
		String s = sc.nextLine();
		String res[] = new String[k];
		int l = s.length();
		int curr=0;
		int min,max;
		boolean flag;
		for(int i=0;i<k;i++)
		{
			flag=true;
			min = (k-i-1) * a;
			max = (k-i-1) * b;
			int j;
			for(j=a;j<=b;j++)
			{
				if(l-curr-j>=min && l-curr-j<=max)
					break;
				if(j==b)
					flag=false;
			}
			if(flag)
			{
				res[i] = s.substring(curr,curr+j);
				curr+=j;
			}
			else
			{
				System.out.println("No solution");
				break;
			}
			if(i==k-1)
			{
				for (String s1:res)
				{
					System.out.println(s1);
				}
			}
		}
	}
}