#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;

using pii = pair<int, int>;
const int N = 1000010, M = 1010, SZ = (1 << 18) + 5;
static char buf[SZ], *bgn = buf, *til = buf;
char getc() {
    if(bgn == til)  bgn = buf, til = buf + fread(buf, 1, SZ, stdin);
    return bgn == til ? EOF : *bgn++;
}
template<typename T>
void read(T &x) {
    char ch = getc();  T fh = 0;   x = 0;
    while(ch < '0' || ch > '9')    fh |= (ch == '-'), ch = getc();
    while(ch >= '0' && ch <= '9')   x = x * 10 + ch - '0', ch = getc();
    x = fh ? -x : x;
}
template<typename Type, typename... argc>
void read(Type &x, argc &...args)   {read(x), read(args...);}
template<typename T>
void print(T x) {
    if(x < 0)  putchar('-'), x = -x;
    if(x / 10)  print(x / 10);
    putchar(x % 10 + '0');
}
int a, b, x, y;
vector<int> px, py, edge[M];
map<pii, int> id;
map<int, pii> pre;
vector<pii> ap, aq;
vector<pii> merge(int a, int x) {
    // cerr << a << " " << x << "\n";
    if(x == a || x == 0)    return {};
    int l = 0, r = a;   vector<pii> tmp;
    py.pb(l), py.pb(r);
    while(l < r) {
        int mid = (l + r) >> 1;
        // cerr << l << " " << r << " " << mid << "\n";
        if((l + r) & 1) return {{-1, -1}};
        tmp.pb({l, r}), py.pb(mid), pre[mid] = {l, r};
        if(x == mid)    return tmp;
        else if(x < mid)    r = mid;
        else    l = mid;        
    }
    return tmp;
}
int add(int x, int y) {
    if(id.find({x, y}) != id.end()) return 0;
    vector<pii> p = merge(a, x), q = merge(b, y);
    if((!p.empty() && p[0].fi < 0) || (!q.empty() && q[0].fi < 0))  return -1;
    int sum = max(p.size(), q.size());
    // printf("%d\n", sum);
    reverse(p.begin(), p.end()), reverse(q.begin(), q.end());
    for(int i = 1; i <= sum; ++i) {
        if(p.size() > q.size()) {
            if(id.find({(p.back().fi + p.back().se) / 2, 0}) == id.end()) {
                add(p.back().fi, 0), add(p.back().se, 0);
                id[{(p.back().fi + p.back().se) / 2, 0}] = 1;
                ap.pb({p.back().fi, 0}), aq.pb({p.back().se, 0});
                // fprintf(stderr, "%d 0 %d 0\n", p.back().fi, p.back().se);
            }
            p.pop_back();
        }
        else if(p.size() < q.size()) {
            if(id.find({0, (q.back().fi + q.back().se) / 2}) == id.end()) {
                add(0, q.back().fi), add(0, q.back().se);  
                id[{0, (q.back().fi + q.back().se) / 2}] = 1;
                ap.pb({0, q.back().fi}), aq.pb({0, q.back().se});
                // fprintf(stderr, "0 %d 0 %d\n", q.back().fi, q.back().se);
            }
            q.pop_back();
        }
        else {
            if(id.find({(p.back().fi + p.back().se) / 2, (q.back().fi + q.back().se) / 2}) == id.end()) {
                add(p.back().fi, q.back().fi), add(p.back().se, q.back().se);
                id[{(p.back().fi + p.back().se) / 2, (q.back().fi + q.back().se) / 2}] = 1;
                ap.pb({p.back().fi, q.back().fi}), aq.pb({p.back().se, q.back().se});
                // fprintf(stderr, "%d %d %d %d\n", p.back().fi, q.back().fi, p.back().se, q.back().se);
            }
            p.pop_back(), q.pop_back();
        }
    }
    id[{x, y}] = 1;
    return 1;
}
int main() {
    #ifdef Kelly
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        freopen("err.txt", "w", stderr);
    #endif
    cin >> a >> b >> x >> y;
    vector<pii> p = merge(a, x);
    swap(px, py);
    vector<pii> q = merge(b, y);
    // cerr << p.size() << " " << q.size() << "\n";
    if((!p.empty() && p[0].fi < 0) || (!q.empty() && q[0].fi < 0))    {cout << "-1";  return 0;}
    id[{0, 0}] = id[{0, b}] = id[{a, 0}] = id[{a, b}] = 1;
    add(x, y);
    printf("%d\n", (int)ap.size());
    for(int i = 0; i < ap.size(); ++i)  printf("%d %d %d %d\n", ap[i].fi, ap[i].se, aq[i].fi, aq[i].se);
    return 0;
}