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
l=input().split(' ')
s=input()
n=int(l[0])
f1=int(l[1])
f2=int(l[2])
if(n%f1==0):
  i=1
  x=n//f1
  d=0
  print(x)
  while(i<=x):
    print(s[d:d+f1])
    i+=1
    d+=f1
elif(n%f2==0):
  d=0
  i=1
  x=n//f2
  print(x)
  while(i<=x):
    print(s[d:d+f2])
    i+=1
    d+=f2
else:
  n1,n2=0,0
  f=True
  while(f==True and n>0):
    n-=f1
    n1+=1
    if(n%f2==0 and n>0):
      n2+=n//f2
      f=False
      n=0
  n=int(l[0])  
  if((n1*f1 +n2 *f2)==n):
    i=1
    print(n1+n2)
    d=0
    while(i<=n1):
      print(s[d:d+f1])
      d+=f1
      i+=1
    i=1  
    while(i<=n2):
      print(s[d:d+f2])
      d+=f2
      i+=1
  else:
    print(-1)
