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>
#pragma comment(linker, "/STACK:64777216")
using namespace std;
const long long maxn = 100001;
const long long maxk = 200001;
const long long maxx = 10001;
const long long secret_number = 87468267;
const long long inf = 1e18;
const int iinf = 2147483647 / 2;
const double pi = 3.141592653589793238462643383279502884;
const double eps = 1e-7;
const string something_very_long =
    "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
    "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
    "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
    "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
    "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
    "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
    "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
    "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
    "aaaaaaaa";
const string govno = "g";
const int maxp = 101;
int n, p, q;
int pr[maxp];
int main() {
  cin.sync_with_stdio(0);
  cin >> n >> p >> q;
  string s;
  cin >> s;
  for (int i = 0; i < maxp; ++i) pr[i] = -2;
  pr[0] = 0;
  queue<int> qq;
  qq.push(0);
  while (!qq.empty()) {
    int cur = qq.front();
    qq.pop();
    if ((cur + p <= s.length()) && (pr[cur + p] == -2))
      pr[cur + p] = cur, qq.push(cur + p);
    if ((cur + q <= s.length()) && (pr[cur + q] == -2))
      pr[cur + q] = cur, qq.push(cur + q);
  }
  stack<string> v;
  int cur = s.length();
  if (pr[cur] == -2) {
    cout << -1;
    return 0;
  }
  while (true) {
    if (cur != 0) {
      v.push(s.substr(pr[cur], cur - pr[cur]));
      cur = pr[cur];
    } else
      break;
  }
  cout << v.size() << '\n';
  while (!v.empty()) {
    string aa = v.top();
    v.pop();
    cout << aa << '\n';
  }
  return 0;
}
