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.io.*;
import java.util.*;
public class split
{
    public static void main(String args[])throws IOException
    {
        BufferedReader k=new BufferedReader(new InputStreamReader(System.in));
        String nm=k.readLine();
        StringTokenizer st=new StringTokenizer(nm);
        int a,b,x,y,n,p,q,i;
        n=Integer.parseInt(st.nextToken());
        p=Integer.parseInt(st.nextToken());
        q=Integer.parseInt(st.nextToken());
        x=(p<q)?p:q;
        y=(p>q)?p:q;
        a=n/x;i=n%x; b=0;
        while(a>=0)
        {
            if(i==0)
            {
                break;
            }
            
            if(i%y==0)
            {
                   b=i/y;
                   break;
            }
            
            i=i+x;a--;
            
        }
        nm=k.readLine();
        String word="";
        
        if(a==-1)
        System.out.println(a);
        else
        {
            System.out.println(a+b);
            for(int j=0;j<nm.length();)
            {

            if(a!=0)
            {
                word=nm.substring(j,j+x);
                System.out.println(word);
                j=j+x;
                a--;
            }
            else if(b!=0)
            {
                word=nm.substring(j,j+y);
                System.out.println(word);
                j=j+y;
                b--;
            }
            else
            word=word;
            }
        }
    }
}