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 n, a, b, c;
string r;
vector<char> vv;
int s[3];
int p[3];
int maxx2 = 1;
int m[100][2] = {0};
int memory;
bool x = true;
int main() {
  cin >> n >> a >> b;
  cin >> r;
  for (int i = 0; i < r.length(); i++) vv.push_back(r[i]);
  int v[n + 1];
  v[0] = 1;
  for (int i = 1; i <= n; i++) {
    int maxx = 0;
    s[0] = i - a;
    s[1] = i - b;
    p[0] = 0;
    p[1] = 0;
    if (s[0] < 0) p[0] = 0;
    if (s[0] == 0) {
      p[0] = 1;
      m[i][0]++;
      x = false;
    }
    if (s[0] > 0 && v[s[0]] != 0) {
      p[0] = 1 + v[s[0]];
      m[i][0]++;
      m[i][0] = m[i][0] + m[s[0]][0];
      m[i][1] = m[i][1] + m[s[0]][1];
      x = false;
    }
    if (s[0] > 0 && v[s[0]] == 0) p[0] = 0;
    if (p[0] > maxx) maxx = p[0];
    if (s[1] < 0) p[1] = 0;
    if (s[1] == 0 && x == true) {
      p[1] = 1;
      m[i][1]++;
    }
    if (s[1] > 0 && v[s[1]] != 0 && x == true) {
      p[1] = 1 + v[s[0]];
      m[i][1]++;
      m[i][0] = m[i][0] + m[s[1]][0];
      m[i][1] = m[i][1] + m[s[1]][1];
    }
    if (s[1] > 0 && v[s[1]] == 0) p[1] = 0;
    if (p[1] > maxx) maxx = p[1];
    v[i] = maxx;
    x = true;
  }
  if (v[n] == 0)
    cout << "-1";
  else {
    cout << m[n][0] + m[n][1] << "\n";
    int k = 0;
    while (m[n][0] != 0) {
      for (int i = 0; i < a; i++) {
        cout << vv[i + k];
      }
      m[n][0]--;
      k = k + a;
      cout << "\n";
    }
    while (m[n][1] != 0) {
      for (int i = 0; i < b; i++) {
        cout << vv[i + k];
      }
      m[n][1]--;
      k = k + b;
      cout << "\n";
    }
  }
}
