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
n, p, q = [int(x) for x in input().split(" ")]
string = input()
s = list()
for i in range(n + 1):
    for j in range(n + 1):
        if n == (i * p + j * q):
            print(i + j)
            index = 0
            for k in range(i):
                s.append(string[index:index + p])
                index += p
            for k in range(j):
                s.append(string[index:index + q])
                index += q
            for k in s:
                print(k)
            exit()

print(-1)
# from collections import Counter
# import operator
#
# n = int(input())
# string = input()
# lst = ['A', 'G', 'C', 'T']
# count = Counter(string)
# questions = None
# if count.get('?'):
#     questions = count.pop("?")
# try:
#     temp_mx = max(count.items(), key=operator.itemgetter(1))[1]
# except:
#     pass
# if not questions:
#     for i in lst:
#         if i not in count:
#             print('===')
#             exit()
#     for k, v in count.items():
#         if v < temp_mx:
#             print('===')
#             exit()
#     print(string)
#     exit()
# if n % 4 != 0:
#     print('===')
#     exit()
# mx = n // 4
# if questions == n:
#
#     temp = n // 4
#     for i in lst:
#         string = string.replace("?", i, temp)
#     print(string)
#     exit()
# if n < 4 * temp_mx:
#     print('===')
#     exit()
# for i in lst:
#     if i not in count:
#         count[i] = 0
# for k, v in count.items():
#     if v < mx:
#         temp = mx - v
#         string = string.replace("?", k, temp)
#         v += temp
# print(string)
