#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define endl '\n'
#define log(...) (void(0))
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;
using lll = __int128;

set<pair<int, int>> s;
vector<pair<int, int>> vec;

int a, b, a1, b1, a2, b2;

pair<int, int> get_lu(int x, int m) {
  if (x == 0) return make_pair(0, 0);
  if (x == m) return make_pair(m, m);
  int y = x & -x;
  return make_pair(x - y, x + y);
}

void search(int x, int y) {
  if (s.count(make_pair(x, y))) {
    return;
  }
  log("> search %d %d\n", x, y);
  s.insert(make_pair(x, y));
  auto [x1, x2] = get_lu(x, a2);
  auto [y1, y2] = get_lu(y, b2);
  search(x1, y1);
  search(x2, y2);
  vec.emplace_back(x, y);
}

int main() {
#ifdef memset0
  freopen("C.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);

  cin >> a >> b;
  if (a) {
    a1 = a, a2 = 1;
    while (a1 % 2 == 0) a1 >>= 1, a2 <<= 1;
  } else {
    a1 = 1, a2 = 0;
  }
  if (b) {
    b1 = b, b2 = 1;
    while (b1 % 2 == 0) b1 >>= 1, b2 <<= 1;
  } else {
    b1 = 1, b2 = 0;
  }
  log(">> %d %d %d %d\n", a1, b1, a2, b2);
  int x, y;
  cin >> x >> y;
  if (x % a1 || y % b1) {
    cout << -1 << endl;
    return 0;
  }
  x /= a1;
  y /= b1;
  s.insert(make_pair(0, 0));
  s.insert(make_pair(a2, 0));
  s.insert(make_pair(0, b2));
  s.insert(make_pair(a2, b2));
  search(x, y);
  // reverse(all(vec));
  cout << sz(vec) << endl;
  for (auto [x, y] : vec) {
    auto [x1, x2] = get_lu(x, a2);
    auto [y1, y2] = get_lu(y, b2);
    cout << x1 * a1 << ' ' << y1 * b1 << ' ' << x2 * a1 << ' ' << y2 * b1 << endl;
  }
}