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
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		
		int k, a,b;
		Scanner sc = new Scanner(System.in);
		
		k=sc.nextInt();
		a=sc.nextInt();
		b=sc.nextInt();
		int g;
		String str = sc.next();
		
		int  length = str.length();
		
		int q,r,i,l1,l2;
		
		if( (k*b >= length) && (k*a<=length)  )
		{
		    
		    
		    q=length/k;
		    r=length%k;
		    int p=k-r;
		    
		    if(r>0)
		    {
		        g=q+1;
		    }
		    
		    else
		    g=q;
		    
		    
		    int count1=0;
		    
		    l1=q*p-1;
		    
		    for(i=0;i<=l1;i++)
		   {
		       System.out.print(str.charAt(i));
		       count1++;
		       if(count1%q == 0)
		       System.out.print("\n");
		   }
		   
		   int count2 =0;
		   
		   l2= q*p;
		   
		   for(i=l2;i<length;i++)
		   {
		       System.out.print(str.charAt(i));
		       
		       count2++;
		       
		       if(count2 % g == 0)
		       {
		           System.out.print("\n");
		       }
		       
		   }
		    
		    
		}
		else
		{
		    System.out.println("No solution");
		}
		
		
	}
}
