#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1005;
int ans[4][N];
int t1, t2;
int t3, t4;
void solve(int &tot, int n, int x, int *a1, int *a2){
	int L=0, R=n;
	while(L<x&&x<R){
		if((L+R)%2){
			puts("-1");
			exit(0);
		}
		int mid=(L+R)/2;
		++tot;
		a1[tot]=L, a2[tot]=R;
		if(x==mid) break;
		if(x<mid) R=mid;
		else L=mid;
	}
}
int main(){
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	memset(ans, -1, sizeof(ans));
	int n, m, x, y;
	scanf("%d%d%d%d", &n, &m, &x, &y);
	solve(t1, n, x, ans[0], ans[2]);
	solve(t2, m, y, ans[1], ans[3]);
	int res=max(t1, t2);
	memset(ans, 0, sizeof(ans));
	t1=res-t1, t2=res-t2;
	solve(t1, n, x, ans[0], ans[2]);
	solve(t2, m, y, ans[1], ans[3]);
	printf("%d\n", res);
	for(int i=1; i<=res; ++i){
		printf("%d %d %d %d\n", ans[0][i], ans[1][i], ans[2][i], ans[3][i]);
	}
	return 0;
}