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


public class E {
    
    public static void main(String[] args){
      
        Scanner in = new Scanner(System.in);
        
        int k = in.nextInt();
        int a = in.nextInt();
        int b = in.nextInt();

        String s= in.next();
        int l = s.length();
        
        if( a == b){
            if( l-a < k*a && k*a <= l){
              while(s.length()>0){
                System.out.println( s.substring(0 , a)); 
                s = s.substring(a);
              }
            }
            else{
              System.out.println("No solution");
            }
            return;
        }
        
        
        for( int i = a; i <= b; i++){
          int c = l - i;
          int q = (c - a*(k-1))/(b - a);
          int p = k - 1 - q;
          
          if( p*a + q*b == c && p >= 0 && q >= 0){
              for( int x = 0; x < p; x++){
                System.out.println( s.substring(0 , a)); 
                s = s.substring(a);
              }
              for( int x = 0; x < q; x++){
                System.out.println( s.substring(0 , b)); 
                s = s.substring(b);
              }
              System.out.println(s);
              return;
          }
          
        }
        
        System.out.println("No solution");
    }
}
