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())
word = input()

def estcomb(n , p , q):
    l = n//p
    for i in range (0,l+1):
        k=i*p
        a=i
        j=0
        while (k<n):
            k+=q
            j+=1
        if ( k==n):
            return( 1 , a , j)
    return (0 , a , j)

c,i,j= estcomb(n,p,q)
d=0
e=0
f=0

if (c==0):
   print (-1)

else :
    print (i+j,"\n")
    for a in range (0,i):
        print(word[a+f:a+p+f],"\n")
        f+=p-1
        d+=p
        
    for b in range (d,d+j):
        print(word[b+e:b+q+e],"\n")
        e+=q-1

        

        



