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;
int n, p, q;
string s;
void wczytaj_dane() { cin >> n >> p >> q >> s; }
int rozszerzony_algorytm_Euklidesa(int a, int b, int& x, int& y) {
  int xx[2] = {1, 0}, yy[2] = {0, 1};
  while (b > 0) {
    int qq = a / b;
    a -= qq * b;
    for (int i = 0; i < (2); i++) {
      xx[i] -= qq * yy[i];
      swap(xx[i], yy[i]);
    }
    swap(a, b);
  }
  x = xx[0];
  y = xx[1];
  return a;
}
int podloga(int a, int b);
int sufit(int a, int b);
int podloga(int a, int b) {
  if (a < 0) return -sufit(-a, b);
  return a / b;
}
int sufit(int a, int b) {
  if (a < 0) return -podloga(-a, b);
  return a % b == 0 ? a / b : a / b + 1;
}
void wypisz(int a, int b) {
  cout << a + b << '\n';
  for (int i = 0; i < (a); i++) cout << s.substr(i * p, p) << '\n';
  for (int i = 0; i < (b); i++) cout << s.substr(a * p + i * q, q) << '\n';
}
void rozwiaz() {
  int x, y, d = rozszerzony_algorytm_Euklidesa(p, q, x, y);
  if (n % d != 0) {
    cout << "-1\n";
    return;
  }
  x *= (n / d);
  y *= (n / d);
  int k[2] = {sufit(-x * d, q), sufit(y * d, p)};
  x += k[0] * (q / d);
  y -= k[0] * (p / d);
  if (k[0] > k[1] || x < 0 || y < 0) {
    cout << "-1\n";
    return;
  }
  wypisz(x, y);
}
void zrob_test() {
  wczytaj_dane();
  rozwiaz();
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  zrob_test();
  return 0;
}
