You are given the string s of length n and the numbers p, q. Split the string s to pieces of length p and q.

For example, the string "Hello" for p = 2, q = 3 can be split to the two strings "Hel" and "lo" or to the two strings "He" and "llo".

Note it is allowed to split the string s to the strings only of length p or to the strings only of length q (see the second sample test).

Input

The first line contains three positive integers n, p, q (1 ≤ p, q ≤ n ≤ 100).

The second line contains the string s consists of lowercase and uppercase latin letters and digits.

Output

If it's impossible to split the string s to the strings of length p and q print the only number "-1".

Otherwise in the first line print integer k — the number of strings in partition of s.

Each of the next k lines should contain the strings in partition. Each string should be of the length p or q. The string should be in order of their appearing in string s — from left to right.

If there are several solutions print any of them.

Examples

Input

5 2 3
Hello


Output

2
He
llo


Input

10 9 5
Codeforces


Output

2
Codef
orces


Input

6 4 5
Privet


Output

-1


Input

8 1 1
abacabac


Output

8
a
b
a
c
a
b
a
c
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class ATheTextSplitting {
        public void solve(int testNumber, MyInputReader in, PrintWriter out) {
            int ls = in.nextInt();
            int p = in.nextInt();
            int q = in.nextInt();
            String s = in.next();

            int fsp = -1;
            int fsq = -1;
            for (int i = 0; i <= 100; i++) {
                for (int j = 0; j <= 100; j++) {
                    if (p * i + j * q == ls) {
                        fsp = i;
                        fsq = j;
                    }
                }
            }
            if (fsp == -1) {
                out.println(-1);
                return;
            }
            out.println(fsp + fsq);
            int from = 0;
            for (int i = 0; i < fsp; i++) {
                out.println(s.substring(from, from + p));
                from += p;
            }
            for (int i = 0; i < fsq; i++) {
                out.println(s.substring(from, from + q));
                from += q;
            }
        }

    }

    static class MyInputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        public MyInputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    String l = reader.readLine();
                    if (l == null) throw new RuntimeException("asd");
                    tokenizer = new StringTokenizer(l);
                } catch (Exception e) {
                    //return null;
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}

