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
S = input().split()
n = int(S[0])
p = int(S[1])
q = int(S[2])
s = input()
i=0
t=0
c=0
b=0
if (n%q == 0) and (n%p != 0):
    print(int(n/q))
    for k in range(0,n,q):
        print(s[k:k+q])
elif (n%p == 0) and (n%q != 0):
    print(int(n/p))
    for k in range(0,n,p):
        print(s[k:k+p])
elif (n%q == 0) and (n%p == 0):
    print(int(n/p))
    for k in range(0,n,p):
        print(s[k:k+p])
else:
    while (n>0) and (i==0) :
        n -= p
        if (n%q==0) and (n>0): i=1
        t+=1
    if i==1:
        print(int(t+n/q))
        for k in range(0,t):
            print(s[c:c+p])
            c+=p
            b+=p
        for k in range(0,int(n/q)):
            print(s[b:b+q])
            b+=q
    else:print(-1)