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.LinkedList;
import java.util.Queue;
import java.util.Scanner;

/**
 *
 * @author AdminHP-262
 */
public class TheTextSplitting {

    public static void main(String[] args) throws Exception {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        int p = scanner.nextInt();
        int q = scanner.nextInt();

        String s = scanner.next();

        boolean check = false;
        Queue<String> queue = new LinkedList<String>();
        if (n % p == 0) {
            for (int i = 0; i < n; i += p) {
                queue.add(s.substring(i, i + p));
            }
        } else if (n % q == 0) {
            for (int i = 0; i < n; i += q) {
                queue.add(s.substring(i, i + q));
            }
        } else {
            int MAX = Math.max(p, q);
            int MIN = Math.min(p, q);
            int temp = MAX;
            boolean CHECK = true;
            int loopP = 0;
            for (int i = MAX; i < n; i += MAX) {

                loopP++;
                if ((n - temp) % MIN == 0) {
                    CHECK = false;
                    break;
                }
                temp += MAX;
            }
            if (CHECK) {
                check = true;
            } else {

                //16/3=5  16/5=3
                if (n % p == q) {
                    int loop = n - (n % p);
                    for (int i = 0; i < loop; i += p) {
                        queue.add(s.substring(i, i + p));
                    }
                    queue.add(s.substring(loop, n));
                } else if (n % q == p) {
                    int loop = n - (n % q);
                    for (int i = 0; i < loop; i += q) {
                        queue.add(s.substring(i, i + q));
                    }
                    queue.add(s.substring(loop, n));
                } else {
                    int max = Math.max(p, q);
                    int min = Math.min(p, q);
                    loopP *= max;
                    for (int i = 0; i < loopP; i += max) {
                        queue.add(s.substring(i, i + max));
                    }
                    for (int i = loopP; i < n; i += min) {
                        queue.add(s.substring(i, i + min));
                    }
                }
            }
        }
        if (check) {
            System.out.println("-1");
        } else {
            System.out.println(queue.size());
            while (!queue.isEmpty()) {
                System.out.println(queue.poll());
            }
        }
    }
}
