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.LinkedList;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class tmp {
    public static void main(String [] args) throws Exception{
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(in.readLine());
        StringBuilder sb = new StringBuilder();
        
        int n = Integer.parseInt(st.nextToken());
        int p = Integer.parseInt(st.nextToken());
        int q = Integer.parseInt(st.nextToken());
        String s = in.readLine();
        
        if(n % (p+q) == 0){
            System.out.println(n/(p+q)*2);
            for(int i=0; i<n/(p+q); i++){
                System.out.println(s.substring(i*(p+q),i*(p+q)+p));
                System.out.println(s.substring(i*(p+q)+p,i*(p+q)+p+q));
            }
        }else 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*p+p));
            }
        }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*q+q));
            }
        }else{
            int out = 0;
            while(s.length() >= Math.max(p, q)){
                out++;
                sb.append(s.substring(0,Math.max(p, q))).append("\n");
                s = s.substring(Math.max(p, q));
                if(s.length()%Math.min(p, q) == 0)
                    break;
            }
            
            while(s.length() >= Math.min(p, q)){
                out++;
                sb.append(s.substring(0,Math.min(p, q))).append("\n");
                s = s.substring(Math.min(p, q));
            }

            if(s.length() == 0){
                System.out.println(out + "\n" + sb.toString());
            }else{
                System.out.println("-1");
            }
        }
        
        
        
        
        
        
        
        
        
        
        
        
        
        
    }
  
    
    
    
    
    
    
    
    
    
    


    
    
    
    
}

    
class P implements Comparable<P>{
    int val, idx;
    public P(int val, int idx){
        this.val = val;
        this.idx = idx;
    }

    public int compareTo(P other){
        if (this.val != other.val) return -this.val + other.val;
        return this.idx - other.idx;
    }
}