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
# André Victor de Andrade Lopes
# Contest: "Educational Codeforces Round 4" - A

n, p, q = map(int,input().split(" "))
word = input()
answer = []
v=0
if n%p ==0:
    v=0
    while(v+p <=n):
        answer.append(word[v:v+p])
        v+=p
elif n%q ==0:
    v=0
    while(v+q <=n):
        answer.append(word[v:v+q])
        v+=q

if v!= n:
    vp = 0
    vq = 0
    aindaDa = True
    while aindaDa and ((vp*p)+(vq*q)) < n:
        vp+=1
        vq =0
        j=0
        while(aindaDa):
            j+=1
            if (j > n/q):
                vq = 0
                break
            vq+=1
            if ((vp*p)+(vq*q)) == n:
                v=n
                aindaDa = False

if v==n:
    if answer == []:
        v=0
        for i in range(vp):
            answer.append(word[v:v+p])
            v += p
        for j in range(vq):
            answer.append(word[v:v+q])
            v += q
    print(len(answer))
    for w in answer:
        print(w)
else:
    print(-1)