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.math.*;

/**
 *
 * @author sarthak
 */
public class educationalround4_C {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int p = s.nextInt();
        int q = s.nextInt();
        s.nextLine();

        String st = s.nextLine();
       //System.out.println(  st.length() );
        for (int i = 0; i <= n / p; i++)
        {
            
            for (int j = 0; j <= n / q; j++) 
            {
                if (i * p + j * q == n) 
                {
                    
                    System.out.println(i +  j);
                    if (i != 0 && j != 0)
                    {
                        int m = 0;
                        for (int k = 1; k <= i; k++) {
                            System.out.println(st.substring(m * p, m * p + p));
                            m++;
                        }
                        m--;
                        int o = (m + 1) * p;
                        int l = 0;
                       // System.out.println(o);
                        for (int k = 1; k <= j; k++) {
                            System.out.println(st.substring( o + l*q,  o + l*q+q));
                            l++;
                        }
                    }
                    else if (j==0&&i!=0)
                    {
                        int m=0;
                        for(int k=1;k<=i;k++){
                            System.out.println(st.substring(m*p, m*p+p));
                        m++;}

                    }
                    else if(j!=0 && i==0)
                    {
                        int m=0;
                        for(int k=1;k<=j;k++){
                            System.out.println(st.substring(m*q, m*q+q));
                        m++;}
                        
                    }
                    return;
                }

                

            }

        }
        System.out.println(-1);

    }

}
