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.Scanner;

public class CP {
	public static void main(String[] args) throws Exception {
		Scanner scan = new Scanner(System.in);
		String[] in = scan.nextLine().split(" ");
		int n = Integer.parseInt(in[0]);
		int p = Integer.parseInt(in[1]);
		int q = Integer.parseInt(in[2]);
		String s = scan.nextLine();
		scan.close();
		int ss = n;
		int np = 0, nq = 0;
		boolean b = false;
		boolean a = false;
		if (ss%p == 0) {
			np = ss/p;
		} else if (ss%q == 0) {
			nq = ss/q;
		} else {
			a = true;
			while (ss - p >= q) {
				ss -= p;
				np++;
				if (ss%q == 0) {
					nq = ss/q;
					break;
				}
				if (ss < p) {
					if (b) {
						out(-1);
						return;
					}
					ss = n;
					int temp = p;
					p = q;
					q = temp;
					np = 0;
					nq = 0;
					b = true;
					continue;
				}
			}
		}
		if (np + nq == 0 || (a && (np == 0 || nq == 0))) {
			out(-1);
			return;
		}
		out(np + nq);
		int id = 0;
		for (int i = 0; i < np; i++)
			out(s.substring(id, id += p));
		for (int i = 0; i < nq; i++)
			out(s.substring(id, id += q));
	}
	public static void out(Object i) {
		System.out.println(i);
	}
}