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

public class Main {

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int n;
        int k = sc.nextInt();
        int a = sc.nextInt();
        int b = sc.nextInt();
        String s = sc.next();
        int l = s.length();
        int m[] = new int[201];
        if ((k * a > s.length()) || (k * b < s.length())) {
            System.out.println("No solution");
        } else {
            l = l - a * k;
            for (int i = 0; i < k; ++i) {
                m[i] = a;
            }
            n = 0;
           for(int i=l;i>0;i--) {
                m[n] = m[n] + 1;
                n++;
                if (n == k) {
                    n = 0;
                }
            }
            n=0;
            for (int i = 0; i < k; ++i) {
                for(int j=0;j<m[i];j++){
                    System.out.print(s.charAt(n+j));
                }
                n=n+m[i];
                System.out.println();
            }
        }

        sc.close();
    }
}