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

/**
 *
 * @author Josè Manuel Garcìa
 */
public class TextSplit {

    /**
     * @param args the command line arguments
     */
    public static boolean isMul(int cant,int n)
    {
        if(cant%n==0) return true;
        return false;
    }
    public static void imprimir(int p, int q,int pes, int ques, String s )
    {
        System.out.println(pes+ques);
        int i;
        for (i = 0; i < s.length() && pes>0; i+=p, pes--) {
            System.out.println(s.substring(i, i+p));
        }
        for (; i < s.length() && ques>0; i+=q,ques--) {
            System.out.println(s.substring(i, i+q));
        }
    }
    public static void main(String[] args) {
        // TODO code application logic here
        int n,p,q,a,b,pes=0,qus=0;
        Scanner leer=new Scanner(System.in);
        n=leer.nextInt();
        p=leer.nextInt();
        q=leer.nextInt();
        
        String s=leer.next();
        int i=0;
        a=n/p;
        b=n/q;
        int j;
        if(n%p==0)
        {
            pes+=n/p;
            imprimir(p,q,pes,qus,s);
                    System.exit(0);        
        }
        else if(n%q==0){
            qus+=n/q;
            imprimir(p,q,pes,qus,s);
                    System.exit(0);
        }
        else{
            int r,sobrante;
            for (int k = 1; k*p<=n ; k++) {
                r=k*p;
                sobrante=n-r;
                if(isMul((sobrante),q))
                {
                    pes=k;
                    qus=(n-r)/q;
                    
                    imprimir(p,q,pes,qus,s);
                    System.exit(0);
                    
                    
                }
            }
            
        }
        
        if(pes+qus!=n) System.out.println("-1");
        
        
    }
    
}
