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 = map(int, input().split())
s = input()
verbose = False

dp = 0
dq = 0

for i in range((n//p) + 1):
    if((n - p * i) % q == 0):
        dp = i
        dq = round((n - p * i) / q)
        verbose = True
        break
if (verbose == False):
    print (-1)
else:
    print (dp + dq)
    for i in range(0, dp*p, p):
        print (s[i:i+p])
    for i in range(p*dp, len(s), q):
        print (s[i:i+q])





'''
if(n == p+q):
    contador += 2
    vecWord.append(s[:p])
    vecWord.append(s[p:])

if(n%p == 0):
    contador += n/p
    maneras = int(n/p)
    i = 0
    for _ in range(maneras):
        word = ''
        j = i
        for _ in range(i, p + i):
            word = word + s[j]
            j += 1
        vecWord.append(word)
        i += p

if(n%q == 0 and p != q):
    contador += n/q
    maneras = int(n/q)
    i = 0
    for _ in range(maneras):
        word = ''
        j = i
        for _ in range(i, q + i):
            word = word + s[j]
            j += 1
        vecWord.append(word)
        i += q

if(contador > 0):
    print (int(contador))
    for word in vecWord:
        print (word)
else:
    print (-1)
'''
