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 CJ2 {

	public static void solve(String s, int k, int a, int b)
	{
		int n=s.length();
		if (a>b || n/k<a || (n%k==0 && n/k>b) || (n%k!=0 && (n/k)+1>b)) 
		{
			System.out.println("No solution");
			return;
		}
		int minchars=n/k;
		int extras=n-(k*(n/k));
		int i=0;
		String ans="";
		while (i<n-(n/k))
		{
			int nexti=i+n/k;
			if (extras!=0)
			{
				extras--;
				nexti++;
			}
			ans=s.substring(i, nexti);
			System.out.println(ans);
			i=nexti;
		}
		System.out.println(s.substring(i, n));
		return;
	}

	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String inp[] = br.readLine().split(" ");
		int k = Integer.parseInt(inp[0]);
		int a = Integer.parseInt(inp[1]);
		int b = Integer.parseInt(inp[2]);
		String s = br.readLine().trim();
		solve(s, k, a, b);

	}

}
