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

n,p,q = [int(x) for x in next(it).split()]
#print n,p,q        # test
palabra = next(it)
#print palabra      #test
s1 = -1
s2 = -1
# from the problem editorial:
# for a fixed number a of len p strings and a fixed number b of len q strings
# string can be split if a*p + b*q == n
for a in xrange(100):
    for b in xrange(100):
        if a*p + b*q == n:
            s1 = a
            s2 = b

if s1 == -1:
    print -1
    exit()

else:
    print s1+s2
    zeroInd = 0
    stop = 0
    while s1 != 0:
        stop += p   # take the value of p
        #slice the string
        print palabra[zeroInd:stop]
        zeroInd += p
        s1 -= 1     # update while loop condition
    while s2 != 0:
        stop += q
        print palabra[zeroInd:stop]
        zeroInd += q
        s2 -= 1
