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

public class CF44E {
    static int n, a, b, strLen;
    static String s;
    static final int SAME = 1, NEW = 2;
    static short[][][] dp, next;
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        a = in.nextInt();
        b = in.nextInt();
        s = in.next();
        strLen = s.length();
        dp = new short[n][strLen][b + 2];
        next = new short[n][strLen][b + 2];
        
        for (int i = 0; i < dp.length; i++) 
            for (int j = 0; j < dp[0].length; j++) 
                Arrays.fill(dp[i][j], (short)-1);
        
        int x = f(0, 0, 0);
        if (x == 0) {
            System.out.println("No solution");
            return;
        }
        
        int line = 0, pos = 0, len = 0;
        StringBuffer sb = new StringBuffer();
        
        while (line < n) {
            if (next[line][pos][len] == SAME) {
                sb.append(s.charAt(pos));
                pos++;
                len++;
            } else {
                sb.append(s.charAt(pos) + "\n");
                line++;
                pos++;
                len = 0;
            }
        }
        System.out.print(sb);
    }
    
    static short f(int line, int pos, int len) {
        if (line == n)
            if (pos == strLen)
                return 1;
            else
                return 0;
        
        if (pos == strLen)
            return 0;
        
        if (dp[line][pos][len] != -1)
            return dp[line][pos][len];
        
        short sameLine = 0, newLine = 0;
        if (len + 1 <= b)
            sameLine = f(line, pos + 1, len + 1);
        
        if (a <= len + 1 && len + 1 <= b)
            newLine = f(line + 1, pos + 1, 0);
        
        if (sameLine > 0) {
            next[line][pos][len] = SAME;
        } else if (newLine > 0) {
            next[line][pos][len] = NEW;
        }
        
        return dp[line][pos][len] = (short)(sameLine + newLine > 0 ? 1 : 0);
    }
}
