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
numbers = list(map(int, input().split()))
string = input()

length = numbers[0]
l1 = numbers[1]
l2 = numbers[2]
counter = 0
max = max(l1, l2)
min = min(l1, l2)

def combinations():
    temp = max
  
    while temp < length:
        if (length - temp) % min == 0:
            s_de_max = int(temp / max)
            s_de_min = int((length - temp) / min) 
            return True
        else:
            temp += max
    return False
if l1 + l2 == length:
    print(2)
    print(string[0:l1]+"\n"+string[l1:length])
elif length % l1 == 0:
    i = 0
    print(int(length / l1))
    while i < length:
        print(string[i:i+l1])
        i += l1
elif length % l2 == 0:
    i = 0
    print(int(length / l2))
    while i < length:
        print(string[i:i+l2])
        i += l2
elif combinations():
    counter = 0
    strings = []
    i = 0
    while (length - i) % l2 != 0:
        counter += 1
        strings.append(string[i:i+l1])
        i += l1
    while i < length:
        counter += 1
        strings.append(string[i:i+l2])
        i += l2
    print(counter)
    for s in strings:
        print(s)
else:
    print(-1)