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.io.OutputStream;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
import java.util.Scanner;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        ProblemDFlowers solver = new ProblemDFlowers();
        solver.solve(in, out,scanner);
        out.close();
    }

    static class ProblemDFlowers {
        private int k,a,b;
        private String string;
        private int []cut;
        private int []dp;
        public void solve( InputReader in, OutputWriter out,Scanner scanner) {
            k=scanner.nextInt();
            a=scanner.nextInt();
            b=scanner.nextInt();
            string=scanner.next();
            cut=new int[k];
            dp=new int[k];
            if (string.length()<a*k||string.length()>b*k) {
                System.out.println("No solution");
                return;
            }
            Arrays.fill(cut,string.length()/k);
            for (int i=0;i<string.length()%k;i++){
                cut[i]++;
            }
            dp[0]=cut[0];
            for (int j=1;j<cut.length;j++){
                dp[j]=dp[j-1]+cut[j];
            }
            System.out.println(string.substring(0,cut[0]));
            for (int i=1;i<cut.length;i++){
                System.out.println(string.substring(dp[i-1],dp[i]));
            }
        }
    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;
        public BufferedReader br;
        public StringTokenizer st;
        public InputReader(InputStream stream) {
            this.stream = stream;
            br = new BufferedReader(new InputStreamReader(this.stream = stream));
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }
        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
        public String nextLine() {
            try {
                return br.readLine();
            }
            catch (Exception e) {
                return null;
            }
        }
        public String next() {
            if (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(nextLine().trim());
                return next();
            }
            return st.nextToken();
        }
        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void println(long i) {
            writer.println(i);
        }

    }
}