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.Arrays;
import java.util.Scanner;


public class Main {
    public static void main(String[] args) {
        Scanner r = new Scanner(System.in);
        
        int k = r.nextInt();
        
        int a = r.nextInt();
        int b = r.nextInt();
        
        char[] t = r.next().toCharArray();

        int[][] S = new int[t.length + 1][k + 1];
        for(int[] i : S)
            Arrays.fill(i, -1);
        
        boolean[][] DP = new boolean[t.length + 1][k + 1];
        
        DP[0][0] = true;
        
        for(int l = 1; l <= t.length; l++)
        for(int rem = 1; rem <= k; rem++)
        for(int x = a; x <= b; x++)
            if(l - x >= 0 && DP[l - x][rem - 1]){
                DP[l][rem] = true;
                S[l][rem] = x;
            }
        
        
        int L = t.length;
        int rem = k;
        int i = 0;
        
        if(!DP[L][k]){
            System.out.println("No solution");
            return;
        }
            
        while(true){
            int x = S[L][rem];
            if(x == -1)break;
            
            L -= x;
            rem--;
            
            String ret = "";
            while(x-- > 0)
                ret += t[i++];
            
            System.out.println(ret);
            
        }
    }
}
