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.io.*;
import java.lang.*;
public class TheTextSplitting {
     static StreamTokenizer st;
    static PrintWriter out;
    
    static int ri()throws IOException
    {
        st.nextToken();
        return (int)st.nval;
    }
    
    
    public static void main(String[] args)throws IOException {
        
        st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        
        Scanner sc = new Scanner(System.in);


//        int n=ri();
//        int p=ri();
//        int q=ri();
//        
//        st.nextToken();
        
        int n = sc.nextInt();
        int p = sc.nextInt();
        int q = sc.nextInt();

        String s = sc.next();
        for (int i = 0; i <=n ; i++) {
            for (int j = 0; j <=n; j++) {
                if(i*p + j*q == n)
                {
                    out.println(i+j);
                    for (int k = 0; k < i*p; k+=p) {
                        out.println(s.substring(k, k+p));
                    }
                    
                    for (int k = i*p; k < s.length(); k+=q) {
                        out.println(s.substring(k, k+q));
                    }
                    out.close();
                    return;
                    
                    
                }
            }
        }
        
        out.println(-1);
        out.close();
    }
    
}
