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 shere {
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int q = sc.nextInt();
        String str = sc.next();
        
        if(n % p == 0 && p != 0) {
            System.out.println(n / p);
            int st = 0;
            for(int i = 0; i < n / p; i++) {
                System.out.println(str.substring(st, st+p));
                st += p;
            }
            return;
        }
        else if(n % q == 0 && q != 0) {
            System.out.println(n / q);
            int st = 0;
            for(int i = 0; i < n / q; i++) {
                System.out.println(str.substring(st, st+q));
                st += q;
            }
            return;
        }
        
        int aux = p;
        while(aux < n) {
            if( (n - aux) % q == 0) {
                System.out.println(aux / p + (n - aux) / q);
                int st = 0;
                for(int i = 0; i < aux / p; i++) {
                    System.out.println(str.substring(st, st+p));
                    st +=p;
                }
                int guard = (n - aux) / q;
                for(int i = 0; i < guard; i++) {
                    System.out.println(str.substring(aux, aux+q));
                    aux += q;
                }
                return;
            }
            else aux += p;
        }
        
        aux = q;
        while(aux < n) {
            if( (n - aux) % p == 0) {
                System.out.println(aux / q + (n - aux) / p);
                int st = 0;
                for(int i = 0; i < aux / q; i++) {
                    System.out.println(str.substring(st, st+q));
                    st += q;
                }
                int guard = (n - aux) / p;
                for(int i = 0; i < guard; i++) {
                    System.out.println(str.substring(aux, aux+p));
                    aux += p;
                }
                return;
            }
            else aux += q;
        }
        System.out.println(-1);
    }
}