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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

import java.util.*;
import javafx.util.Pair;

public class Main
{

    public static void main(String args[])
    {
        FastScanner input = new FastScanner();

        int k = input.nextInt();
        int a = input.nextInt();
        int b = input.nextInt();

        String s = input.next();
        int n = s.length();
        if (a * k > s.length() || k * b < s.length()) {
            System.out.println("No solution");
        } else {
            int per = s.length() / k;
            int extra = s.length() % k;
//            System.out.println(per + " " + extra);

            
                int start = 0;

                while (start < n) {
                    if (extra > 0) {
                        System.out.println(s.substring(start, start + per + 1));
                        extra--;
//                        System.out.println(start + " " + (start + per + 1));
                        start =start+ per + 1;

                    } else {
                        System.out.println(s.substring(start, start + per ));

//                        System.out.println(start + " " + (start + per ));
                        start = start+per ;
                    }

                }
           
        }
    }

    static class FastScanner
    {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer("");

        String next()
        {
            while (!st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt()
        {
            return Integer.parseInt(next());
        }

        long nextLong()
        {

            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine() throws IOException
        {
            return br.readLine();
        }
    }

}
