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
### TEMPLATE BEGIN

from collections import defaultdict

def read_int():
    return int(raw_input())

def read_ints():
    return (int(x) for x in raw_input().split())

def read_int_list():
    return [int(x) for x in raw_input().split()]

def read_float():
    return float(raw_input())

def read_floats():
    return (float(x) for x in raw_input().split())

def read_float_list():
    return [float(x) for x in raw_input().split()]

def read_list():
    return [x for x in raw_input().split()]

def read_str():
    return raw_input()

### TEMPLATE END
n, p, q = read_ints()
s = read_str()

npq = n / (p + q)
# np = (n % (p + q)) / p if n % p == 0 else 0
# nq = (n % (p + q)) / q if n % q == 0 else 0
    # spliting npq
i = 0
finished = False
res = ''
partitions = 0
while True:
    j = i * (p + q)
    rest = n - j
    if rest % p == 0:
        while j < n:
            partitions += 1
            res += s[j:j+p] + '\n'
            j += p
        finished = True
    elif rest % q == 0:
        while j < n:
            partitions += 1
            res += s[j:j+q] + '\n'
            j += q
        finished = True
    elif (j + p + q) <= n:
        partitions += 2
        res += s[j:j+p] + '\n'
        res += s[j+p:j+p+q] + '\n'
        i += 1
    else:
        print -1
        break
    if finished:
        print partitions
        print res[:-1]
        break
    if i > npq:
        print -1
        break
# start = npq * (p + q)
# i = 0
# while i < np:
#     j = i * p + start
#     print s[j:j+p]
#     i += 1
# start = npq * (p + q) + np * p
# i = 0
# while i < nq:
#     j = i * q + start
#     print s[j:j+q]
#     i += 1

