//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si static inline
#define mp make_pair
#define fi first
#define se second
using namespace std;typedef long long ll;typedef __int128 li;
typedef long double ld;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef const int ci;
typedef const ll cl;const int iinf=INT_MAX;const ll linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{

	void mian(){
		int n, m, x, y; scanf("%d %d %d %d", &n, &m, &x, &y);
		if ((x == 0 || x == n) && (y == 0 || y == m)) {
			puts("0"); return;
		}
		if (x == 0 || x == n) {
			if (x == 0) n = 0;
				int mm = 0; while (m % 2 == 0) m /= 2, mm++;
				if (y % m) puts("-1");
				else {
					y /= m; int M = m, N = 1;m = 1 << mm;
					int d = 0; while (d < mm && y % 2 == 0) y /= 2, d++;
					int f = mm - d; vector<int> ops[2];
					for (int i = 0; i < f; i++) ops[0].push_back(0);
					for (int i = 0; i < f; i++) ops[1].push_back(y >> i & 1);
					//printf("%d\n", f);
					int sx = 0, sy = 0; printf("%d\n", f);
					for (int i = 0; i < f; i++) {
						int tx = ops[0][i] ? n : 0, ty = ops[1][i] ? m : 0;
						printf("%d %d %d %d\n", sx * N + n, sy * M,tx * N + n, ty* M);
						sx = (sx + tx) / 2;
						sy = (sy + ty) / 2;
					}
				}
				return;
		}
		if (y == 0 || y == m) {
			swap(n, m); swap(x, y);
			if (x == 0) n = 0;
				int mm = 0; while (m % 2 == 0) m /= 2, mm++;
				if (y % m) puts("-1");
				else {
					y /= m; int M = m, N = 1;m = 1 << mm;
					int d = 0; while (d < mm && y % 2 == 0) y /= 2, d++;
					int f = mm - d; vector<int> ops[2];
					for (int i = 0; i < f; i++) ops[0].push_back(0);
					for (int i = 0; i < f; i++) ops[1].push_back(y >> i & 1);
					//printf("%d\n", f);
					int sx = 0, sy = 0; printf("%d\n", f);
					for (int i = 0; i < f; i++) {
						int tx = ops[0][i] ? n : 0, ty = ops[1][i] ? m : 0;
						printf("%d %d %d %d\n", sy * M, sx * N + n, ty* M,tx * N + n);
						sx = (sx + tx) / 2;
						sy = (sy + ty) / 2;
					}
				}
				return;
		}
				int nn = 0, mm = 0, xx = 0, yy = 0;
				while (n % 2 == 0) n /= 2, nn++;
				while (m % 2 == 0) m /= 2, mm++;
				if (x % n || y % m) puts("-1");
				else {
					x /= n; y /= m; int N = n, M = m;
					n = 1 << nn; m = 1 << mm;
					//printf("%d %d %d %d\n", n, m, x, y);
					while (xx < nn && (x >> (xx + 1) << (xx + 1)) == x) xx++;
					while (yy < mm && (y >> (yy + 1) << (yy + 1)) == y) yy++;
					int dx = nn - xx, dy = mm - yy;
					//printf("dxdy %d %d\n", dx, dy);
					// nn - xx max(dx, dy)
					x >>= xx; x <<= max(dx, dy) - dx;
					y >>= yy; y <<= max(dx, dy) - dy; 
					//printf("xy %d %d\n", x, y);
					vector<int> ops[2];
					for (int i = 0; i < max(dx, dy); i++) if (x >> i & 1) ops[0].push_back(1); else ops[0].push_back(0);
					for (int i = 0; i < max(dx, dy); i++) if (y >> i & 1) ops[1].push_back(1); else ops[1].push_back(0);
					//for (int x : ops[1]) printf("%d\n", x);
					//if (dx <= dy) {
						
					//}
					int sx = 0, sy = 0; printf("%d\n", max(dx, dy));
					for (int i = 0; i < max(dx, dy); i++) {
						int tx = ops[0][i] ? n : 0, ty = ops[1][i] ? m : 0;
						printf("%d %d %d %d\n", sx * N, sy * M,tx * N, ty* M);
						sx = (sx + tx) / 2;
						sy = (sy + ty) / 2;
					}
				}
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}