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;
long long fastPow(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = (ret * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return ret;
}
void printSegments(long long n, string s) {
  for (int i = int(0); i < int(s.length()); i++) {
    if (!(i % n) && i != 0) cout << endl;
    cout << s[i];
  }
  cout << endl;
}
void printVector(vector<string> segments) {
  for (int i = int(0); i < int(segments.size()); i++)
    cout << segments[i] << endl;
}
bool recSegments(long long n, long long p, long long q,
                 vector<string>& segments, long long i, string str) {
  if (!n) {
    cout << segments.size() << endl;
    printVector(segments);
    return true;
  }
  if (n >= p) {
    if (!(n % p)) {
      cout << segments.size() + n / p << endl;
      printVector(segments);
      printSegments(p, str.substr(i));
      return true;
    }
    segments.push_back(str.substr(i, p));
    if (recSegments(n - p, p, q, segments, i + p, str))
      return true;
    else
      segments.pop_back();
  }
  if (n >= q) {
    if (!(n % q)) {
      cout << segments.size() + n / q << endl;
      printVector(segments);
      printSegments(q, str.substr(i));
      return true;
    }
    segments.push_back(str.substr(i, q));
    if (recSegments(n - q, p, q, segments, i + q, str))
      return true;
    else
      segments.pop_back();
  }
  return false;
}
int main() {
  long long n, p, q;
  string str;
  cin >> n >> p >> q >> str;
  if ((n % 2 && !(p % 2) && !(q % 2)) || (p == q && n % p)) {
    cout << -1 << endl;
    return 0;
  }
  if (!(n % p)) {
    cout << n / p << endl;
    printSegments(p, str);
    return 0;
  }
  if (!(n % q)) {
    cout << n / q << endl;
    printSegments(q, str);
    return 0;
  }
  vector<string> segments;
  bool possible;
  possible = recSegments(n, p, q, segments, 0LL, str);
  if (!possible) cout << -1 << endl;
  return 0;
}
