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
from __future__ import print_function
import sys
it = iter(sys.stdin.read().splitlines())

n,p,q = [int(x) for x in next(it).split()]
s = next(it)
s1,s2 = -1, -1
# n == len(s)

for i in xrange(100):
    for j in xrange(100):
        if(p*i + q*j == n):
            s1 = i
            s2 = j
if(s1 == -1):
    print(-1)
    exit()
print(s1+s2)
start = 0
k = 0
while(s1 != 0):
    k += p
    print(s[start:k])
    start += p
    s1 -= 1
while(s2 != 0):
    k += q
    print(s[start:k])
    start += q
    s2 -=1
