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 Practice2.CF44;

import java.util.Scanner;

public class CF044E {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int k = s.nextInt();
        int a = s.nextInt();
        int b = s.nextInt();
        s.nextLine();
        String str = s.next();
        if(b * k < str.length() || a * k > str.length()){
            System.out.println("No solution");
        }else{
            StringBuilder[][] ans = new StringBuilder[k+1][str.length()+1];
            boolean[][] visited = new boolean[k+1][str.length()+1];
//            System.out.println(str.length());

            StringBuilder anssss = function(k,a,b,str,0,ans,visited);
            if(anssss == null){
                System.out.println("No solution");
            }else{
                System.out.println(anssss.toString());
            }
        }
    }

    private static StringBuilder function(int num, int a, int b, String str,int start, StringBuilder[][] ans,boolean[][] visited) {
        if(start > str.length()){
            return null;
        }
        if(num == 1){
            visited[num][start] = true;
            if(str.length() - start >= a && str.length() - start <= b){
                return ans[num][start] = new StringBuilder(str.substring(start));
            }else{
                return ans[num][start] = null;
            }

        }

        if(visited[num][start]){
            return ans[num][start];
        }
        String k = str;
        for (int i = a; i <= b; i++) {
            StringBuilder str1 = new StringBuilder(str.substring(start,i+start));
            String s1 = k.substring(i+start);
            StringBuilder ans1 = function(num - 1,a,b,str,i+start,ans,visited);
            if(ans1 != null){
                str1.append("\n");
                str1.append(ans1);
                visited[num][start] = true;
                return ans[num][start] = str1;
            }
        }
        visited[num][start] = true;
        return ans[num][start] = null;
    }

}
