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 Splitting {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int q = sc.nextInt();

        sc.nextLine();
        String s = sc.nextLine();
        sc.close();

        if(n%p == 0) {
            System.out.println(n/p);
            getPartitions(s, p, n);
            return;
        }

        if(n%q == 0) {
            System.out.println(n/q);
            getPartitions(s, q, n);
            return;
        }

        int max, min;
        if(p > q) {
            max = p;
            min = q;
        }
        else {
            max = q;
            min = p;
        }

        ArrayList<String> list = new ArrayList<String>();
        int i=0;

        while((n-i) >= min && (n-i)%max != 0) {
            list.add(s.substring(i, i+min));
            i += min;
        }

        if((n-i) <= min) {
            System.out.println(-1);
            return;
        }

        while((n-i) >= max) {
            list.add(s.substring(i, i+max));
            i+=max;
        }

        System.out.println(list.size());
        for(String splitted: list) {
            System.out.println(splitted);
        }
    }

    public static void getPartitions(String s, int p, int n) {
        for(int i=0; i<=n-p; i+=p) {
            System.out.println(s.substring(i, i+p));
        }
    }
}