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
len_string, p, q = [int(x) for x in input().split()]
string = input()
substrings = []
big = max([p, q])
small = min([p, q])
force1 = True
force2 = True

def group(size, n=False):
	global len_string, string, substring
	while len_string >= size:
		substrings.append(string[0:size])
		string = string[size:]
		len_string -= size
		if n: break

def force_group(p, q):
	global len_string
	groups = []
	local = len_string
	for x in range(p, len_string, p):
		local -= p
		groups.append(p)
		if (len_string -x) % q != 0:
			continue
		for y in range(0, len_string-x, q):
			local -= q
			groups.append(q)
		break	
	if local == 0:
		for x in groups:
			group(x, True)
		return True
	return False


while len_string > 0:
	if len_string % p == 0:
		group(p)
	elif len_string % q == 0:
		group(q)
	elif (len_string % p) % q == 0:
		group(p)
		group(q)
	elif (len_string % q) % p == 0:
		group(q)
		group(p)
	elif force1:
		if force_group(p, q):
			break
		force1 = False
	elif force2:
		if force_group(q, p):
			break
		force2 = False
	else:
		print(-1)
		exit()
		
print(len(substrings))
for w in substrings:
	print(w)
