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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import static java.lang.Math.*;
import java.math.*;
import java.text.DecimalFormat;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int p = in.nextInt();
        int q = in.nextInt();
        String s = in.next();

        if (n % p == 0) {
            System.out.println(n / p);
            int j = 0;
            for (int i = 1; i <= n / p; i++) {
                for (; j < p * i; j++) {
                    System.out.print(s.charAt(j));
                }
                System.out.println("");
            }
        } else if (n % q == 0) {
            int j = 0;
            System.out.println(n / q);
            for (int i = 1; i <= n / q; i++) {
                for (; j < q * i; j++) {
                    System.out.print(s.charAt(j));
                }
                System.out.println("");
            }
        } else if ((n % max(p, q)) % min(p, q) == 0) {
            int j = 0;
            System.out.println((n % max(p, q)) / min(p, q) + n / max(p, q));
            for (int i = 1; i <= (n / max(p, q)); i++) {
                for (; j < max(p, q) * i; j++) {
                    System.out.print(s.charAt(j));
                }
                System.out.println("");
            }
            int x = j;

            for (int i = 1; i <= (n % max(p, q)) / min(p, q); i++) {
                x += min(p, q);
                for (; j < x; j++) {
                    System.out.print(s.charAt(j));
                }
                System.out.println("");
            }
        } else if ((n % (p + q)) % min(p, q) == 0) {
            int j = 0;
            System.out.println(((n % (p + q)) / min(p, q)) + n / (p + q) * 2);
            for (int i = 1; i <= (n / (p + q)); i++) {
                for (; j < max(p, q) * i; j++) {
                    System.out.print(s.charAt(j));
                }
                System.out.println("");
            }
            int x = j;

            for (int i = 1; i <= ((n % (p + q)) / min(p, q) + (n / (p + q))); i++) {
                x += min(p, q);
                for (; j < x; j++) {
                    System.out.print(s.charAt(j));
                }
                System.out.println("");
            }
        } else {
            int t = min(p, q);
            int o = 0;
            int j = 0;
            while (n > 0) {

                n -= t;
                o++;
                if (n % max(q, p) == 0) {
                    break;
                }
            }
            if (n % max(q, p) == 0) {
                System.out.println(o + (n / max(p, q)));
                for (int i = 1; i <= o; i++) {
                    for (; j < min(p, q) * i; j++) {
                        System.out.print(s.charAt(j));
                    }
                    System.out.println();
                }
                int w = j;
                for (int i = 1; i <= n / max(p, q); i++) {
                    w += max(p, q);
                    for (; j < w; j++) {
                        System.out.print(s.charAt(j));
                    }
                    System.out.println();
                }
            } else {
                System.out.println(-1);
            }

        }

    }

    static int Obe(long a, long b) {
        BigInteger b1 = new BigInteger("" + a);
        BigInteger b2 = new BigInteger("" + b);
        BigInteger gcd = b1.gcd(b2);
        return gcd.intValue();
    }

    static int che(int[] w) {
        Set<Integer> list = new LinkedHashSet<>();
        for (int i = 0; i < w.length; i++) {
            list.add(w[i]);
        }
        return list.size();
    }

    private static ArrayList<BigInteger> fibCache = new ArrayList<BigInteger>();

    static {
        fibCache.add(BigInteger.ZERO);
        fibCache.add(BigInteger.ONE);
    }

    public static BigInteger fib(int n) {
        if (n >= fibCache.size()) {
            fibCache.add(n, fib(n - 1).add(fib(n - 2)));
        }

        return fibCache.get(n);
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());

    }

}
