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
# cook your dish here
n,p,q=map(int,input().split())
s=input()
if n>=min(p,q):
    mini=min(p,q)
    maxi=max(p,q)
    rem=n%mini
    a=n//mini
    diff=maxi-mini
    if diff!=0:
        if rem!=0:
            if rem>=diff:
                if rem%diff==0:
                    b=rem//diff
                    if b<=a:
                        a=a-b
                        print(a+b)
                        for i in range(a):
                            print(s[0:mini])
                            s=s[mini:len(s)]
                        for i in range(b):
                            print(s[0:maxi])
                            if len(s)!=0:
                                s=s[maxi:len(s)]
                            else:
                                pass
                    else:
                        print("-1")
            
                else:
                    while(a>0):
                        if rem%maxi==0:
                            b=rem//maxi
                            print(a+b)
                            for i in range(a):
                                print(s[0:mini])
                                s=s[mini:len(s)]
                            for i in range(b):
                                print(s[0:maxi])
                                s=s[maxi:len(s)]
                            break
                        else:
                            rem+=mini
                            a-=1
                    else:
                        print(-1)
            else:
                rem=n%maxi
                a=n//maxi
                while(a>0):
                    if rem%mini==0:
                        b=rem//mini
                        print(a+b)
                        for i in range(a):
                            print(s[0:maxi])
                            s=s[maxi:len(s)]
                        for i in range(b):
                            print(s[0:mini])
                            if len(s)!=0:
                                s=s[mini:len(s)]
                            else:
                                pass
                        break
                    else:
                        rem+=maxi
                        a-=1
                else:
                    print(-1)
        else:
            print(a)
            for i in range(a):
                print(s[0:mini])
                s=s[mini:len(s)]
                    
    else:
        if n%p==0:
            print(n//p)
            for i in range(n//p):
                print(s[0:p])
                if len(s)!=0:
                    s=s[p:len(s)]
                else:
                    pass
        else:
            print(-1)
else:
    print(-1)