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.*;
import java.util.Objects;
import java.util.StringTokenizer;
import java.util.stream.IntStream;

public class Main {

    static StringTokenizer st;
    static BufferedReader br;
    static PrintWriter pw;

    public static void main(String[] args)  throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream, true);

        int n = in.nextInt(),
        p = in.nextInt(),
        q = in.nextInt();
        String s = in.next();
        for (int i = 0; i < 101; ++i){
            for (int j = 0; j < 101; ++j){
                if (n == i * p + j * q){
                    out.println(i + j);
                    int offset = 0;
                    for (int k = 0; k < i; k++) {
                        out.println(s.substring(offset, offset + p));
                        offset += p;
                    }
                    for (int k = 0; k < j; k++) {
                        out.println(s.substring(offset, offset + q));
                        offset += q;
                    }
                    return;
                }
            }
        }
        System.out.printf("-1");
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

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

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public double nextDouble () {
            return Double.parseDouble(next());
        }

    }
}
