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;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author madi
 */
public class Round44E {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] in = sc.nextLine().split(" ");
        int k = Integer.parseInt(in[0]);
        int a = Integer.parseInt(in[1]);
        int b = Integer.parseInt(in[2]);

        String str = sc.nextLine();
        int len = str.length();
        
        if (k * b < len || k * a > len) {
            System.out.println("No solution");
        } else {
            int[] lens = new int[k];
            
            for (int i = 0; i < k; i++) {
                lens[i] = a;
                len = len -a;
            }
            
            int ind = 0;
            while (len > 0) {
                lens[ind] = b;
                len = len + a - b;
                ind++;
            }

            if (ind > 0) {
                lens[ind - 1] = a;
                lens[ind - 1] = lens[ind - 1] + len + b - a;
            }

            int t = 0;
            for (int i = 0; i < k; i++) {
                System.out.println(str.substring(t, t + lens[i]));
                t += lens[i];
            }


        }

    }
}
