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
n,p,q=map(int,raw_input().split())
s=raw_input()

def func(x):
	print n/x
	for k in xrange(0,n/x):
		print s[(x*k):(x*(k+1))]

mi,ma=sorted([p,q])

def function():
	for i in xrange(1,n/ma+1):
		if (n-ma*i)%mi==0:
			temp=(n-ma*i)/mi
			print i+temp
			for j in xrange(0,i):
				print s[(ma*j):(ma*(j+1))]
			for l in xrange(0,temp):
				print s[(ma*(j+1)):][(mi*l):(mi*(l+1))]
			return
	print "-1"
	return

if p+q==n:
	print "2"
	print s[:p]
	print s[p:]
elif n%p==0:
	func(p)
elif n%q==0:
	func(q)
else:
	function()