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())
ch=input()
l=len(ch)

idx1=0
idx2=0


if((n%p)==0):
    print(n//p)
    #print("shit1")
    idx1=0
    for i in range(n//p):
        
        print(ch[idx1:idx1+p])
        idx1+=p
elif((n%q)==0):
    print(n//q)
    #print("shit2")
    for i in range(n//q):
        
        print(ch[idx2:idx2+q])
        idx2+=q
else:
    if((n%p)%q)==0:
        print((n//p)+((n%p)//q))
        #print("shit3")
        for i in range(n//p):
            print(ch[idx1:idx1+p])
            idx1+=p
        idx2=idx1    
        for i in range((n%p)//q):
            
            print(ch[idx2:idx2+q])
            idx2+=q
    elif((n%q)%p)==0:
        print((n//q)+((n%q)//p))
        #print("shit4")
        for i in range(n//q):
            print(ch[idx2:idx2+q])
            idx2+=q
        idx1=idx2
        for i in range((n%q)//p):
            
            print(ch[idx1:idx1+p])
            idx1+=p

    else:
        nb1=n
        nb2=0
        while(((nb1%q)!=0) and (((nb1-p)>=0))):
            nb1-=p
            nb2+=1
        if((nb1%q)==0):
            print((nb2)+(nb1//q))
            #print("shit5")
            for i in range(nb2):
                print(ch[idx1:idx1+p])
                idx1+=p
            idx2=idx1
            for i in range(nb1//q):
                
                print(ch[idx2:idx2+q])
                idx2+=q
        
        elif((nb1%q)!=n):
            nb1=n
            nb2=0
            while(((nb1%p)!=0) and (nb1-q>=0)):
                nb1-=q
                nb2+=1
            if((nb1%p)==0):
                print((nb2)+(nb1//p))
                #print("shit6")
                for i in range(nb2):
                    print(ch[idx1:idx1+q])
                    idx1+=q
                idx2=idx1
                for i in range(nb1//p):
            
                    print(ch[idx2:idx2+p])
                    idx2+=p
            else:
                print(-1)



    




    
