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.InputStreamReader;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        FastScanner fs = new FastScanner();

        int n = fs.nextInt();
        int p = fs.nextInt();
        int q = fs.nextInt();
        String s = fs.next();
        List<Integer> list = new ArrayList<>();

        if (n % p == 0) {
            System.out.println(n / p);
            int prev = 0;
            for (int i = 0; i < n / p; i++) {
                System.out.println(s.substring(prev, prev + p));
                prev += p;
            }
        } else if (n % q == 0) {
            System.out.println(n / q);
            int prev = 0;
            for (int i = 0; i < n / q; i++) {
                System.out.println(s.substring(prev, prev + q));
                prev += q;
            }
        } else if (n % (p + q) == 0) {
            System.out.println(n / (p + q) * 2);
            int prev = 0;
            for (int i = 0; i < n / (p + q); i++) {
                System.out.println(s.substring(prev, prev + p));
                System.out.println(s.substring(prev + p, prev + p + q));
                prev = prev + p + q;
            }
        } else {
            int tmp = n - (p + q);
            list.add(p);
            list.add(q);
            boolean flag = false;
            while (tmp >= p || tmp >= q) {
                if (tmp % p == 0) {
                    for (int i = 0; i < tmp / p; i++) {
                        list.add(p);
                    }
                    flag = true;
                    break;
                } else if (tmp % q == 0) {
                    for (int i = 0; i < tmp / q; i++) {
                        list.add(q);
                    }
                    flag = true;
                    break;
                }
                tmp -= (p + q);
                list.add(p);
                list.add(q);
            }

            if (!flag) {
                System.out.println(-1);
            } else {
                int prev = 0;
                System.out.println(list.size());
                for (Integer i : list) {
                    if (i == p) {
                        System.out.println(s.substring(prev, prev + p));
                        prev += p;
                    } else {
                        System.out.println(s.substring(prev, prev + q));
                        prev += q;
                    }
                }
            }
        }

        // end main
    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

        double nextDouble() { return Double.parseDouble(next()); }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}
