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  Anfisa_the_Monkey
{
	public static void main(String[] args) throws IOException 
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw=new PrintWriter(System.out);

		int t=1;

		while(t-->0)
		{
			String str[]=br.readLine().trim().split(" ");
			int n=Integer.parseInt(str[0]);
			int a=Integer.parseInt(str[1]);
			int b=Integer.parseInt(str[2]);
			String s=br.readLine().trim();
			int len=s.length();

			if(n*a>len)
			{
				System.out.println("No solution");
				System.exit(0);
			}

				int dp[]=new int[n+1];
				dp[n]=len;
				for(int i=1;i<n;i++)
					dp[i]=dp[i-1]+a;

				for(int i=n-1;i>0;i--)
				{
					if(dp[i+1]-dp[i]>b)
					{
						dp[i]+=(dp[i+1]-dp[i])-b;
					}
				}

				
				for(int i=0;i<n;i++)
				{
					if(dp[i+1]-dp[i]>b)
					{
						System.out.println("No solution");
						System.exit(0);
					}
					pw.println(s.substring(dp[i],dp[i+1]));
				}
						
		}
		pw.flush();
	}

	
}