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;
string str;
void split(int num, int x) {
  int i = num;
  while (str[i]) {
    cout << str[i];
    i++;
    if (i % x == 0) cout << endl;
  }
}
int main() {
  int n, p, q, i, temp, cnt = 0, tempcnt = 0, extra, flag;
  cin >> n >> p >> q;
  cin >> str;
  if (p > q) swap(p, q);
  if (n < p)
    cout << "-1" << endl;
  else {
    if (n % p == 0) {
      cout << (n / p) << endl;
      split(0, p);
    } else if (n % q == 0) {
      cout << (n / q) << endl;
      split(0, q);
    } else {
      temp = n;
      while (1) {
        temp -= p;
        cnt++;
        if (temp % q == 0) {
          flag = 1;
          break;
        }
        if (temp < p) {
          flag = 0;
          break;
        }
      }
      if (flag == 0) cout << "-1" << endl;
      if (flag == 1) {
        extra = p * cnt;
        cnt += (temp / q);
        cout << cnt << endl;
        while (tempcnt < extra) {
          cout << str[tempcnt];
          tempcnt++;
          if (tempcnt % p == 0) cout << endl;
        }
        cnt = 0;
        while (str[tempcnt]) {
          cout << str[tempcnt];
          tempcnt++;
          cnt++;
          if (cnt % q == 0) {
            cout << endl;
          }
        }
      }
    }
  }
  return 0;
}
