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 = list(map(int,input().split()))
s = input()
f=False
#if len(s)%p==0:
#    f = True
#    print(len(s)//p)
#    print(*[s[i:i+p] for i in range(0,len(s),p)],sep='\n')
#if len(s)%q==0:
#    f = True
#    print(len(s)//q)
#    print(*[s[i:i+q] for i in range(0,len(s),q)],sep='\n')
for i in range(len(s)//p+1):
    r = p*i
    if (len(s)-r)%q==0 and (len(s)-r)//q>0:

        f=True
        c=0
        print(i+(len(s)-r)//q)
        for i in range(1,i+1):
            print(s[c:c+p])
            c+=p
        for i in range(1,len(s)-r//q+1):
            print(s[c:c+q])
            c+=q
        break
    if len(s)%p==0:
        f = True
        print(len(s)//p)
        print(*[s[i:i+p] for i in range(0,len(s),p)],sep='\n')
        break
    if len(s)%q==0:
        f = True
        print(len(s)//q)
        print(*[s[i:i+q] for i in range(0,len(s),q)],sep='\n')
if not f:
    print(-1)