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
import math
import sys,string
input=sys.stdin.readline
import random
from collections import deque,defaultdict
import bisect
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
n,p,q=M()
s=input()
if(n%p==0):
    print(n//p)
    for i in range(0,n,p):
        print(s[i:i+p])
elif(n%q==0):
    print(n//q)
    for i in range(0,n,q):
        print(s[i:i+q])
else:
    w=min(p,q)
    c=0
    y=max(q,p)
    while(n%y!=0 and n>=0):
        n-=w
        c+=1
    if(n%y==0):
        print(c+n//y)
        i=0
        while(c!=0):
            print(s[i:i+w])
            i+=w
            c-=1
        c=n//y
        while(c!=0):
            print(s[i:i+y])
            i+=y
            c-=1
    else:
        print(-1)
