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
#!/usr/bin/python

from sys import argv, exit

def rstr():
    return input()

def rint():
    return int(input())

def rints():
    return [int(i) for i in input().split(' ')]

def prnt(*args):
    if '-v' in argv:
        print(*args)

def shieldthing(n, p, q):
    shield = n
    eb = p
    iv = q
    ebn = 0
    ivn = 0

    while shield > 0:
        if shield % iv == 0:
            ivn = shield / iv
            return ebn, ivn
        shield -= eb
        ebn += 1
    if shield == 0:
        return ebn, ivn
    return -1, -1

(n,p,q) = rints()
s = rstr()

pn, qn = shieldthing(n, p, q)

if pn == -1:
    print('-1')
    exit(0)

print(int(pn+qn))
i = 0
while pn > 0:
    print(s[i:i+p])
    i = i + p
    pn -= 1
while qn > 0:
    print(s[i:i+q])
    i = i + q
    qn -= 1
