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.*;

public class TheTextSplitting {

    static StringTokenizer st;
    static BufferedReader in;
    static PrintWriter out;

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

    private static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    private static byte nextByte() throws IOException {
        return Byte.parseByte(next());
    }

    private static String next() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }

    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

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

        String s = next();
        boolean ok = false;
        for (int i = 0; i <= n && !ok; i++) {
            for (int j = 0; j <= n; j++) {
                if (i * p + j * q == n) {
                    System.out.println(i + j);
                    int idex = 0;
                    for (int k = 0; k < i*p; k+=p) {
                        System.out.println(s.substring(k, p+idex));
                        idex += p;
                    }
                    for (int k = 0; k < j;k++)
                    {
                        System.out.println(s.substring(idex,q+idex));
                        idex+=q;
                        

                    }

                    ok = true;
                    break;
                }

            }

        }
        if (!ok) {
            System.out.println("-1");
        }
    }

}
