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.util.ArrayList;
import java.util.Scanner;
public class P6 {
    public static void main(String args[]) {
        Scanner x = new Scanner(System.in);
        int n = x.nextInt();
        int p = x.nextInt();
        int q = x.nextInt();
        boolean possible = true;
        boolean possible2 = true;
        boolean possiblePQ = true;
        ArrayList<String> subs = new ArrayList<>();

        String s = x.next();
        String ss[] = s.split("");

        if (n % p == 0) {
            possible = false;
            possible2 = false;
            int pCount = 0;
            String aux = "";
            for (String s1 : ss) {
                aux += s1;
                pCount++;
                if (pCount == p) {
                    subs.add(aux);
                    pCount = 0;
                    aux = "";
                }
            }

        }

        if ((n % q == 0) && possible) {
            possiblePQ = false;
            int qCounter = 0;
            String aux = "";
            for (String s1 : ss) {
                aux += s1;
                qCounter++;
                if (qCounter == q) {
                    subs.add(aux);
                    qCounter = 0;
                    aux = "";
                }
            }
        }

        if (possible2 && possiblePQ) {
            int letter = p;
            boolean sliced = false;

            while (!s.equals("")) {
                if (!sliced) {
                    if (s.length() >= letter) {
                        String y = s.substring(0, letter);
                        subs.add(y);
                        s = s.substring(letter);
                    } else {
                        letter = q;
                        sliced = true;
                    }

                } else {
                    if (!subs.isEmpty()) {
                        if (s.length() % q == 0) {
                            String y = s.substring(0, letter);
                            subs.add(y);
                            s = s.substring(letter);
                        } else {
                            s = subs.remove(subs.size() - 1) + s;

                        }
                    } else {
                        System.out.println(-1);
                        System.exit(0);

                    }

                }
            }
            if (!subs.isEmpty()) {
                System.out.println(subs.size());
                for (int i = 0; i < subs.size(); i++) {
                    System.out.println(subs.get(i));

                }
                System.exit(0);

            }
        }
        System.out.println(subs.size());
        for (int i = 0; i < subs.size(); i++) {
            System.out.println(subs.get(i));

        }

    }

}