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.*;
import java.io.*;
public class A
{
    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+q))
        {
            System.out.println("2");
            System.out.println(str.substring(0,p));
            System.out.println(str.substring(p));
        }
        else if(n!=(p+q))
        {
            if(n%p==0)
            {
                System.out.println(n/p);
                for(int i=0;i<n;i=i+p)
                {
                    System.out.println(str.substring(i,i+p));
                }
            }
            else if(n%q==0)
            {
                System.out.println(n/q);
                for(int i=0;i<n;i=i+q)
                {
                    System.out.println(str.substring(i,i+q));
                }
            }
            else if(n%p!=0&&n%q!=0)
            {
                if(p>=q)
                {
                    int nn=n,x=0,flag=0;
                    while(nn%p!=0)
                    {
                        nn=nn-q;
                        if(nn<0)
                        {
                            flag=1;
                            break;
                        }
                        x++;
                    }
                    int y=nn/p;
                    //System.out.println(x+" "+y);
                    if(flag==1)
                    System.out.println(-1);
                    else
                    {
                        System.out.println(x+y);
                        int i=0;
                        while(y-->0)
                        {
                            System.out.println(str.substring(i,i+p));
                            i=i+p;
                        }
                        while(x-->0)
                        {
                            System.out.println(str.substring(i,i+q));
                            i=i+q;
                        }
                    }
                }
                else if(p<q)
                {
                    int nn=n,x=0,flag=0;
                    while(nn%q!=0)
                    {
                        nn=nn-p;
                        if(nn<0)
                        {
                            flag=1;
                            break;
                        }
                        x++;
                    }
                    int y=nn/q;
                    if(flag==1)
                    System.out.println(-1);
                    else
                    {
                        System.out.println(x+y);
                        int i=0;
                        while(x-->0)
                        {
                            System.out.println(str.substring(i,i+p));
                            i=i+p;
                        }
                        while(y-->0)
                        {
                            System.out.println(str.substring(i,i+q));
                            i=i+q;
                        }
                    }
                }
            }
        }
    }
}