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

def printRes(split, l, r):
  output = []
  i = 0
  c = l
  while i < n:
    output.append(s[i:i + c])
    i += c
    if i >= split:
      c = r
  print(len(output))
  for chars in output:
    print("".join(chars))

if n % p == 0:
  printRes(n, p, q)
elif n % q == 0:
  printRes(n, q, p)
elif n < p + q:
  print(-1)
else:
  split = -1
  i = p
  while i < n:
    if (n - i) % q == 0:
      split = i
      break
    i += p
  if split != -1:
    printRes(split, p, q)
  else:
    i = q
    while i < n:
      if (n - i) % p == 0:
        split = i
        break
      i += q
    if split != -1:
      printRes(split, q, p)

  if split == -1:
    print(-1)

