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
input1 = input()
input1 = input1.split()
n = int(input1[0])
p = int(input1[1])
q = int(input1[2])

if p > q:
	p,q = q,p

string = input()

prev = [-1] * (n+1)
nr_splits = [0] * (n+1)

prev[0] = 0

for i in range(p, q):
	if prev[i-p] != -1:
		prev[i] = p
		nr_splits[i] = nr_splits[i-p]+1

for i in range(q, n+1):
	if prev[i-p] != -1:
		prev[i] = p
		nr_splits[i] = nr_splits[i-p]+1
	elif prev[i-q] != -1:
		prev[i] = q
		nr_splits[i] = nr_splits[i-q]+1

if prev[n] == -1:
	print(-1)
else:
	print(nr_splits[n])
	i = 0
	while n > 0:
		print(string[i:i+prev[n]])
		i = i + prev[n]
		n = n - prev[n]
