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
from math import ceil


n, p, q = map(int, input().split())
s = input()

if p == n or q == n:
  print(f'1\n{s}')
else:
  if p > q:
    p, q = q, p

  P = ceil(n/p)
  Q = ceil(n/q)
  cnts = [-1, -1]
  i = P
  while i >= 0:
    _sum = p*i
    j = 0
    while j <= Q and _sum < n:
      _sum += q
      j += 1

    if _sum == n:
      cnts = [i, j]
      break

    i -= 1

  if _sum == n:
    cnts = [i, j]
    
  if cnts[0] == -1:
    print(-1)
  else:
    print(sum(cnts))
    _i = 0
    for i in range(cnts[0]):
      print(s[_i:_i+p])
      _i += p
    for j in range(cnts[1]):
      print(s[_i:_i+q])
      _i += q
