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 sys import stdout

def getMax(x, y):
    if x > y:
        return x
    return y

def getMin(x, y):
    if x < y:
        return x
    return y

n, p, q = map(int, raw_input().split())
string = raw_input()
if n%(p+q) == 0:
    index = 0
    print str(2*(n/(p+q)))
    for i in range(0, n/(p+q), 1):
        for j in range(0, p, 1):
            stdout.write(string[index])
            index += 1
        print
        for j in  range(0, q, 1):
            stdout.write(string[index])
            index += 1
        print
elif n%p == 0:
    index = 0
    print str(n/p)
    for i in range(0, n/p, 1):
        for j in range(0, p, 1):
            stdout.write(string[index])
            index += 1
        print
elif n%q == 0:
    index = 0
    print str(n/q)
    for i in range(0, n/q, 1):
        for j in range(0, q, 1):
            stdout.write(string[index])
            index += 1
        print
else:
    l = len(string)
    possible = False
    partitions = 0
    while((l%getMin(p, q)) != 0):
        l -= getMax(p, q)
        partitions += 1
        if l < 0:
            break
    else:
        possible = True
    if possible:
        print str(partitions + (l/getMin(p, q)))
        l = len(string)
        index = 0
        while((l%getMin(p, q)) != 0):
            for i in range(0, getMax(p, q), 1):
                stdout.write(string[index])
                index += 1
            print
            l -= getMax(p, q)
        while(l > 0):
            for i in range(0, getMin(p, q), 1):
                stdout.write(string[index])
                index += 1
            print
            l -= getMin(p, q)
    else:
        print str(-1)