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.math.*;
import java.text.*;

public class Text {

	public static Integer[] parse(String st) {
		String[] a = st.split(" ");
		Integer[] ar = new Integer[a.length];
		for (int i = 0; i < a.length; i++) 
			ar[i] = Integer.parseInt(a[i]);
		return ar;
	}

	public static void solve(String s, int p, int q) {
		int x = 0;
		int y = 0;
		for (x = 0; x <= 100; x++) {
			for (y = 0; y <= 100; y++) {
				if (p*x + q*y == s.length()) {
					System.out.println (x + y);
					String pre = s.substring(0, p*x);
					String pos = s.substring(p*x, s.length());
					for (int i = 0; i < pre.length(); i += p) {
						System.out.println(pre.substring(i, i + p));
					}

					for (int i = 0; i < pos.length(); i += q) {
						System.out.println(pos.substring(i, i + q));
					}

					return;
				}
			}
		}	
		System.out.println("-1");
	}

	public static void main(String[] args) {
		try {
			InputStreamReader is = new InputStreamReader(System.in);
			BufferedReader br = new BufferedReader(is);
			Integer[] par = parse(br.readLine());
			String s = br.readLine();
			solve(s, par[1], par[2]);
		} catch (Exception e) {e.printStackTrace();}
	}

}

