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
import sys
a,b,c = map(int, raw_input().split(" "))
sss = raw_input()
exit = 0
if a % b == 0:
  print a / b
  for i in range(0, a/b):
    ans = ""
    for j in range(i*b, i*b+b):
      ans = ans + sss[j]
    print ans
  exit = 1
if exit == 1:
  sys.exit()
if a % c == 0:
  print a / c
  for i in range(0, a/c):
    ans = ""
    for j in range(i*c, i*c+c):
      ans = ans + sss[j]
    print ans
  exit = 1
if exit == 1:
  sys.exit()
for i in range(a/b+1):
	if (a-b*i)%c == 0:
		break
yosi = i
if (a-b*yosi)%c==0:
	print yosi + (a-b*yosi)/c
	for i in range(0, yosi):
		ans =""
		for j in range(i*b,i*b+b):
			ans = ans + sss[j]
		print ans
	uwa = j + 1
	for i in range((a-b*yosi)/c):
		ans =""
		for j in range(i*c+yosi*b,i*c+yosi*b+c):
			ans = ans + sss[j]
		print ans
	exit = 1
if exit == 1:
	sys.exit()
print "-1"
