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.util.HashSet;

public class Ejercicio6 {

 public static void main(String[] args){
     Scanner sc = new Scanner(System.in);
     int n = sc.nextInt();
     int p = sc.nextInt();
     int q = sc.nextInt();
     sc.nextLine();
     String s = sc.nextLine();
     /*int n = 5;
     int p = 2;
     int q = 3;
     String s = "Hello";*/
     splitting(n, p, q, s);
     sc.close();
 }

 public static void splitting(int n, int p, int q, String s){
   int[] ab = getNumbers(n, p, q);
   System.out.println(ab[0]+ab[1]); //printing the number of times p and q can be repeated
   if(ab[0] == -1) return;
   if(ab[0] != 0){
    for(int i=0, cont=0; cont<ab[0]; i+=p){
     System.out.println(s.substring(i,i+p)); //i=2
     cont++;
     }
   }
   if(ab[1] != 0){
    for(int i=ab[0]*p; i+q<=n; i+=q){
     System.out.println(s.substring(i,i+q));
    }
   }
 }

 public static int[] getNumbers(int n, int p, int q){
   //Finding a and b. Worst case 100 x 100 which is not that bad.
   for(int a=0; a<=100; a++){
     for(int b=0; b<=100; b++){
       int eq = a*p + b*q;
       if(eq == n){
         return new int[] {a, b};
       }
     }
   }
   return new int[] {-1, 0};
 }
}