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 main() {
  int n, p, q, i, flagp = 0, flagq = 0, count = 0, diff, t1, c1, c2;
  string s;
  vector<string> str;
  cin >> n >> p >> q;
  cin >> s;
  if (p > n && q > n) cout << -1;
  if (p + q == n) {
    cout << 2 << "\n";
    str.push_back(s.substr(0, p));
    str.push_back(s.substr(p, q));
    cout << str[0] << "\n";
    cout << str[1];
  } else if (p + q < n && p != q && n % p != 0 && n % q != 0) {
    t1 = p;
    c1 = 1;
    while (t1 < n) {
      c1++;
      t1 += p;
    }
    t1 -= p;
    c1--;
    diff = n - t1;
    while (diff < n) {
      if (diff % q == 0) break;
      diff += p;
      c1--;
    }
    if (diff == n)
      cout << -1;
    else {
      c2 = diff / q;
      i = 0;
      while (c1 > 0) {
        str.push_back(s.substr(i, p));
        i += p;
        c1--;
        count++;
      }
      while (c2 > 0) {
        str.push_back(s.substr(i, q));
        i += q;
        c2--;
        count++;
      }
      cout << count << "\n";
      for (i = 0; i < str.size(); i++) cout << str[i] << "\n";
    }
  } else {
    if (n % p == 0)
      flagp = 1;
    else if (n % q == 0)
      flagq = 1;
    if (flagp != 1 && flagq != 1)
      cout << -1;
    else {
      if (flagp == 1) {
        for (i = 0; i < n; i += p) {
          count++;
          str.push_back(s.substr(i, p));
        }
      } else if (flagq == 1) {
        for (i = 0; i < n; i += q) {
          count++;
          str.push_back(s.substr(i, q));
        }
      }
      cout << count << "\n";
      for (i = 0; i < str.size(); i++) cout << str[i] << "\n";
    }
  }
}
