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.*;
import java.util.*;

public class Solution {

StreamTokenizer in;
PrintWriter out;

    public static void main(String[] args) throws Exception {
        new Solution().run();
    }

    int nextInt() throws Exception {
        in.nextToken();
        return (int) in.nval;
    }

    String next() throws Exception {
        in.nextToken();
        return in.sval;
    }

    public void run() throws Exception {
        in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(new OutputStreamWriter(System.out));
        int k = nextInt();
        int a = nextInt();
        int b = nextInt();
        String st = next();
        char [] n = new char [200];
        n = st.toCharArray();
        int l= st.length();
        int t=l/k;
        int q;
        if ((b*k>=l)&&(k*a<=l))
        {
            q=l-t*k;
             k-=q;
            for (int i=0;i<k;i++)
            {
              out.println(st.substring(0, t));
              st=st.substring(t, st.length());
            }
            t++;
            for (int i=0;i<q;i++)
            {
              out.println(st.substring(0, t));
              st=st.substring(t, st.length());
            }
        } else out.print("No solution");
        out.flush();
    }

}