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
#include <bits/stdc++.h>
using namespace std;
bool isAValidString(string str, int tam, int p, int q) {
  return ((p > 1 || q > 1 || str.length() == tam) ? true : false);
}
void printResult(string str, int n, int p) {
  std::cout << n / p << '\n';
  int flag = 0;
  while (flag < n) {
    cout << str.substr(flag, p) << '\n';
    flag += p;
  }
}
bool hasModule(int n, int number) { return ((n % number == 0) ? true : false); }
int main() {
  int n, p, q;
  string str;
  cin >> n >> p >> q;
  cin >> str;
  if (!isAValidString(str, n, p, q)) {
    std::cout << "-1" << '\n';
    return 0;
  }
  if (n == p + q) {
    std::cout << "2" << '\n';
    cout << str.substr(0, p) << '\n';
    cout << str.substr(p, q) << '\n';
    return 0;
  }
  if (hasModule(n, p)) {
    printResult(str, n, p);
    return 0;
  }
  if (hasModule(n, q)) {
    printResult(str, n, q);
    return 0;
  }
  int wrs = 0;
  if (q > p) {
    wrs = p;
    p = q;
    q = wrs;
  }
  int varP = 1, varQ = 0;
  for (int i = n; i >= q; i -= p) {
    n = n - p;
    if (n % q == 0) {
      varQ = n / q;
      break;
    }
    varP++;
  }
  int h = 0;
  if (varQ > 0) {
    int ans = varQ + varP;
    int ans1 = p;
    cout << ans << '\n';
    for (int i = 0; i < ans; i++) {
      cout << str.substr(h, ans1 - h) << '\n';
      if ((str.length() - ans1) % q != 0) {
        h = ans1;
        ans1 = ans1 + p;
      } else {
        h = ans1;
        ans1 = ans1 + q;
      }
    }
    return 0;
  }
  std::cout << "-1" << '\n';
  return 0;
}
