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

n, p, q = map(int, sys.stdin.readline().strip().split(" "))
s = sys.stdin.readline().strip()


def show_split(s, p1, c1, p2, c2):
    print "%d" % (c1+c2)
    for i in range(c1):
        print s[p1*i:p1*(i+1)]
    for i in range(c2):
        print s[p1*c1+p2*i:p1*c1+p2*(i+1)]


if n % p == 0:
    show_split(s, p, n / p, q, 0)
    sys.exit()

if n % q == 0:
    show_split(s, q, n / q, p, 0)
    sys.exit()

for i in range(n/p+1):
    for j in range(n/q+1):
        if i*p+q*j == n:
            show_split(s, p, i, q, j)
            sys.exit()
print "-1"