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
var npq = readline().split(' ').map(Number);
var n = npq[0];
var p = npq[1];
var q = npq[2];
var s = readline();
var k = -1;
var np = 0;
var nq = 0;
if (n%p == 0) {
	k = n/p;
	np = k;
} else if (n%q == 0){
	k = n/q;
	nq = k;
} else {
		for (var i=1; i<n/p; i++)	{
			if ( (n-i*p)%q == 0) {
				np = i;
				nq = (n-i*p)/q;
				k = np + nq;
				break;
			}
	}
}
print(k);
if (k != -1) {
	for (var i=0; i<np; i++) {
		print(s.substr(i*p, p));
	}
	for (var i=0; i<nq; i++) {
		print(s.substr(p*np+i*q, q));
	}
}