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

public class The_Text_Splitting {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer tk = new StringTokenizer(in.readLine());
        StringBuilder sb = new StringBuilder();
        int n = Integer.parseInt(tk.nextToken());
        int a = Integer.parseInt(tk.nextToken());
        int b = Integer.parseInt(tk.nextToken());
        String str = in.readLine();
        double y;
        int count = 0;
        for (int i = 0; i <= n / a; i++) {
            y = (double) (n - (i * a)) / (double)b;
            if(y % 1 == 0 && y >= 0){
               count = (int)y + i;
               sb.append(count).append("\n");
                int j;
                for (j = 0; j < i * a; j += a) {
                    sb.append(str.substring(j,j + a)).append("\n");
                }
                for (int k = j ; k < y * b + j ; k += b) {
                    sb.append(str.substring(k, k + b)).append("\n");
                }
                break;
            }
        }
        if (count == 0){
            System.out.println(-1);
        }
        else{
            System.out.println(sb);
        }

    }
}
