#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 100005;

int A, B, x, y, ans[N][5];
signed main() {
    int flag(0), cnt1(0), cnt2(0);
    cin >> A >> B;
    cin >> x >> y;
    int l(0), r(A);
    while (1) {
        if (x == l || x == r)break;
        cnt1++;
        if ((r + l) & 1) {
            flag = 1;
            break;
        } else {
            ans[cnt1][1] = l;
            ans[cnt1][3] = r;
            int mid((l + r) >> 1);
            if (x <= mid) {
                r = mid;
            } else {
                l = mid;
            }
        }
    }
    l = 0, r = B;
    while (1) {
        if (y == l || y == r)break;
        cnt2++;
        if ((r + l) & 1) {
            flag = 1;
            break;
        } else {
            ans[cnt2][2] = l;
            ans[cnt2][4] = r;
            int mid((l + r) >> 1);
            if (y <= mid) {
                r = mid;
            } else {
                l = mid;
            }
        }
    }
    if (cnt1 < cnt2) {
        for (int i = cnt1 + 1; i <= cnt2; i++)ans[i][1] = ans[i - 1][1], ans[i][3] = ans[i - 1][3];
    }
    if (cnt2 < cnt1) {
        for (int i = cnt2 + 1; i <= cnt1; i++)ans[i][2] = ans[i - 1][2], ans[i][4] = ans[i - 1][4];
    }
    if (flag == 0) {
        cout << max(cnt1, cnt2) << '\n';
        for (int i = 1; i <= max(cnt1, cnt2); i++) {
            cout << ans[i][1] << " " << ans[i][2] << " " << ans[i][3] << " " << ans[i][4] << '\n';
        }
    } else cout << -1 << '\n';
    return 0;
}