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());tmp=0;fl=0;m=0
if (p>q):
    tmp=p
    p=q
    q=tmp
s=input()
tk=0;tb=0;
if ((p>n) and (q>n)):
    print(-1)
elif(n%q==0):
    print(n//q)
    for i in range(n//q):
        print(s[i*q:i*q+q])
elif(n%p==0):
    print(n//p)
    for i in range(n//p):
        print(s[i*p:i*p+p])   
else:
    while((n%q!=0) and (n>0)):
        tk+=1
        n-=p
    if (n<0):
        print(-1)
    else:
        tb=n//q
        print(tk+tb)
        for i in range(tk):
            print(s[m:m+p])
            m+=p
        for i in range(tb):
            print(s[m:m+q])
            m+=q
            
        
