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.*;
import java.io.*;
import java.lang.*;

public class Solution {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter out = new PrintWriter(System.out);
    StringTokenizer st = new StringTokenizer("");

    String next() {
        if (!st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {

            }
        }
        return st.nextToken();
    }

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

    long nextLong() {
        return Long.parseLong(next());
    }

    public static void main(String[] args) {
        new Solution().solve();
    }

    void solve() {
        int t = 1;
        // t = nextInt();
        for (int tt = 0; tt < t; tt++) {
            int n = nextInt(), p = nextInt(), q = nextInt();
            char arr[] = next().toCharArray();
            int x = -1, y = -1;
            for (int i = 0;; i++) {
                if ((n - q * i) >= 0) {
                    if ((n - q * i) % p == 0) {
                        x = (n - q * i) / p;
                        y = i;
                    }
                } else {
                    break;
                }
            }
            if (x == -1 || y == -1) {
                out.println(-1);
            } else {
                out.println(x + y);
                int l = 0;
                for (int i = 0; i < x; i++) {
                    for (int j = l; j < l + p; j++) {
                        out.print(arr[j]);
                    }
                    l += p;
                    out.println();
                }
                for (int i = 0; i < y; i++) {
                    for (int j = l; j < l + q; j++) {
                        out.print(arr[j]);
                    }
                    l += q;
                    out.println();
                }
            }
        }
        out.close();
    }
}
