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
line = raw_input().split()
a = int(line[0])
b = int(line[1])
c = int(line[2])
ans1 = 0
ans2 = a/c+1
found = False
while (ans2 != -1):
	if (b*ans1+c*ans2 > a):
		ans2 -= 1
	elif (b*ans1+c*ans2 < a):
		ans1 += 1
	else:
		found = True
		break
if not found:
	print -1
else:
	pointer = 0
	string = str(raw_input())
	print ans1 + ans2
	for i in range(ans1):
		print string[pointer:b+pointer]
		pointer += b
	for i in range(ans2):
		print string[pointer:c+pointer]
		pointer += c