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.*;
public class Main {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt(), m = sc.nextInt(), k = sc.nextInt();
        String s = sc.next();
        if(m+k==n){
            System.out.println(2);
            System.out.println(s.substring(0,m));
            System.out.println(s.substring(m,s.length()));
        } else if(n%k==0){
            System.out.println(n/k);
            for(int i=0;i<n/k;i++){
                System.out.println(s.substring(0,k));
                s = s.substring(k, s.length());
            }
        } else if(n%m==0){
            System.out.println(n/m);
            for(int i=0;i<n/m;i++){
                System.out.println(s.substring(0,m));
                s = s.substring(m, s.length());
            }
        } else {
            int a= -1, b=-1;
            for(int i=0;i<n;i++){
                for(int j=0;j<n;j++){
                    if(i*m+j*k == n){
                        a = i; b = j;
                    }
                }
            }
            if(a==-1 && b==-1){
                System.out.println(-1);
                return;
            } else {
                System.out.println(a+b);
                for(int i=0;i<a;i++){
                    System.out.println(s.substring(0, m));
                    s= s.substring( m, s.length());
                }
                for(int i=0;i<b;i++){
                    System.out.println(s.substring(0, k));
                    s= s.substring(k, s.length());
                }
            }
        }
    }
}
