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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author El-Bishoy
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        E_t_split_string_in_some_way solver = new E_t_split_string_in_some_way();
        solver.solve(1, in, out);
        out.close();
    }

    static class E_t_split_string_in_some_way {
        private int k;
        private int a;
        private int b;
        private int n;
        private ArrayList<String> backtrackList = new ArrayList<>();
        private String s;
        private boolean[][] memo;
        boolean[][] visited;
        ArrayList<String> strings = new ArrayList<>();
        boolean found = false;

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            k = in.nextInt();
            a = in.nextInt();
            b = in.nextInt();
            s = in.nextString();
            n = s.length();
            memo = new boolean[n + 1][n + 1];
            visited = new boolean[n + 1][n + 1];
            split(k, 0, n, 0);

            StringBuilder ans = new StringBuilder();
            for (String ss : strings)
                ans.append(ss).append("\n");

            if (strings.isEmpty())
                out.println("No solution");
            else
                out.println(ans);
        }

        boolean split(int k, int i, int originalLength, int currentLength) {


            if (currentLength > originalLength)
                return false;

            if (found)
                return true;
            if (i == k) {
                if (originalLength == currentLength) {
                    strings.addAll(backtrackList);
                    found = true;
                    return true;
                } else {
                    return false;
                }
            }


            if (visited[i][currentLength]) {
                return memo[i][currentLength];
            }

            boolean f = false;
            for (int j = a; j <= b; j++) {

                if (currentLength + j <= originalLength) {
                    backtrackList.add(s.substring(currentLength, currentLength + j));
                    f = split(k, i + 1, originalLength, currentLength + j);
                    backtrackList.remove(backtrackList.get(backtrackList.size() - 1));
                }
            }

            visited[i][currentLength] = true;
            return memo[i][currentLength] = f;
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            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 nextString() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                if (Character.isValidCodePoint(c)) {
                    res.appendCodePoint(c);
                }
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        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 print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void println(Object... objects) {
            print(objects);
            writer.println();
        }

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

    }
}

