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 Test {   
    
   //_____________________________________________________
     public static void main(String[] args) {
     Scanner in =new Scanner(System.in);
       int a =in.nextInt();
       int b =in.nextInt();
       boolean ch=true;
       int c =in.nextInt();
       String s=in.next();
       String []arr=new String[a];
       int i=0,starti=0,finali=0;   
       int min=Math.min(c, b);
       
       while (a-starti>0) {
            if ((a-starti)%b==0) {
                finali+=b;
               arr[i]=s.substring(starti, finali);
               
           }else if((a-starti)%c==0) {
               finali+=c;
               arr[i]=s.substring(starti, finali);
           }else if ((a-starti)>=min) {
                 finali+=min;
               arr[i]=s.substring(starti, finali);
           }
           
           else {
               ch=false;
                System.out.println("-1");
                break;
           }
            starti=finali;
            i++;
//           System.out.println(starti+"    "+finali);
         }
       
       
       
       
         if (ch) {
             System.out.println(i);
             for (int j = 0; j < i; j++) {
                 System.out.println(arr[j]);
             }
         }
        
     }
}
     