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 JavaApplication2 {
    public static void main(String args[]) {
      Scanner read = new Scanner(System.in);
      int n = read.nextInt();
      int p = read.nextInt();
      int q = read.nextInt();
      read.nextLine();
      String s = read.nextLine();
      boolean bla = true;
      List<String> sub = new ArrayList<String>();
      if(n%p==0 || n%q==0){
          if(n%p==0){
             System.out.println(n/p);
             for(int i = 0; i<n/p; i++){
                System.out.println(s.substring(i*p,(i+1)*p));
             } 
             return;
          }
          else if(n%q==0){
            System.out.println(n/q);
            for(int i = 0; i<n/q; i++){
                System.out.println(s.substring(i*q,(i+1)*q));
             } 
             return;
          }
      }
      else{
          boolean ok = true;
          int start = 0;
          int end = 0;
          while(ok){
              if(n>=p){
                  if(n%q!=0){
                    end+=p;
                    sub.add(s.substring(start, end));
                    start = end;
                    n-=p;
                  }
                  else{
                    end+=q;
                    sub.add(s.substring(start, end));
                    start = end;
                    n-=q;
                    bla = false;
                  }
              }
              else if(n>=q){
                  if(n%q==0){
                    end+=q;
                    sub.add(s.substring(start, end));
                    start = end;
                    n-=q;
                    bla = false;
                  }
                  else{
                      ok = false;
                  }
              }
              else{
                  ok = false;
              }
          }
      }
      if(bla){ System.out.println(-1);}
      else{
          System.out.println(sub.size());
          for(int i = 0; i<sub.size(); i++){
              System.out.println(sub.get(i));
          }
      } 
    }
}