#include <bits/stdc++.h>
using namespace std;
long long int n, i, j, md, hi, lo, mx, h, flag, k, sum, x, t, y, w, ans, q, hsh;
long long int a[1000002], dp[1000007], b[1000007];
map<char, char> m;
stack<char> stk;
int main() {
  ios::sync_with_stdio(false);
  long long int p, q;
  cin >> n >> p >> q;
  string s;
  cin >> s;
  flag = 0;
  for (i = 0; i <= n / p; i++) {
    if ((n - p * i) % q == 0) {
      flag = 1;
      x = i;
      y = (n - p * i) / q;
      break;
    }
  }
  if (flag == 0) {
    cout << "-1\n";
  } else {
    cout << x + y << endl;
    for (i = 0; i < x * p;) {
      for (j = i; j < (i + p); j++) {
        cout << (char)s[j];
      }
      i += p;
      cout << endl;
    }
    for (i = x * p; i < n;) {
      for (j = i; j < (i + q); j++) {
        cout << (char)s[j];
      }
      i += q;
      cout << endl;
    }
  }
}

### Prompt

Please create a solution in CPP to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long int n, i, j, md, hi, lo, mx, h, flag, k, sum, x, t, y, w, ans, q, hsh;
long long int a[1000002], dp[1000007], b[1000007];
map<char, char> m;
stack<char> stk;
int main() {
  ios::sync_with_stdio(false);
  long long int p, q;
  cin >> n >> p >> q;
  string s;
  cin >> s;
  flag = 0;
  for (i = 0; i <= n / p; i++) {
    if ((n - p * i) % q == 0) {
      flag = 1;
      x = i;
      y = (n - p * i) / q;
      break;
    }
  }
  if (flag == 0) {
    cout << "-1\n";
  } else {
    cout << x + y << endl;
    for (i = 0; i < x * p;) {
      for (j = i; j < (i + p); j++) {
        cout << (char)s[j];
      }
      i += p;
      cout << endl;
    }
    for (i = x * p; i < n;) {
      for (j = i; j < (i + q); j++) {
        cout << (char)s[j];
      }
      i += q;
      cout << endl;
    }
  }
}

```