#include<bits/stdc++.h>
using namespace std;
const int N=1e3+5;
int n,m,ax,ay;
int lowbit(int x){return (x&-x);}
int cnt,ans[N][4];
void slv(int x,int y)
{
	//cout<<x<<" "<<y<<endl;
	if(x==0 || x==n)
	{
		if(y==0 || y==m)return ;
		if(lowbit(y)<=lowbit(m))
		{
			int l=0,r=m;
			while(l<=r)
			{
				int mid=l+r>>1;
				cnt++,ans[cnt][0]=x,ans[cnt][1]=l,ans[cnt][2]=x,ans[cnt][3]=r;
				if(mid==y)break;
				else if(mid<y)l=mid;
				else r=mid;
			}
			return ;
		}
		else printf("-1\n"),exit(0);
	}
	else if(y==0 || y==m)
	{
		if(x==0 || x==n)return ;
		if(lowbit(x)<=lowbit(n))
		{
			int l=0,r=n;
			while(l<=r)
			{
				int mid=l+r>>1;
				cnt++,ans[cnt][0]=l,ans[cnt][1]=y,ans[cnt][2]=r,ans[cnt][3]=y;
				if(mid==x)break;
				else if(mid<x)l=mid;
				else r=mid;
			}
			return ;
		}
		else printf("-1\n"),exit(0);
	}
	if(x*2<=n && y*2<=m)
	{
		slv(x*2,y*2);
		cnt++,ans[cnt][0]=0,ans[cnt][1]=0,ans[cnt][2]=x*2,ans[cnt][3]=y*2;
	}
	else if(x*2<=n && m-2*(m-y)>=0)
	{
		slv(x*2,m-2*(m-y));
		cnt++,ans[cnt][0]=0,ans[cnt][1]=m,ans[cnt][2]=x*2,ans[cnt][3]=m-2*(m-y);
	}
	else if(n-2*(n-x)>=0 && y*2<=m)
	{
		slv(n-2*(n-x),y*2);
		cnt++,ans[cnt][0]=n,ans[cnt][1]=0,ans[cnt][2]=n-2*(n-x),ans[cnt][3]=y*2;
	}
	else
	{
		slv(n-2*(n-x),m-2*(m-y));
		cnt++,ans[cnt][0]=n,ans[cnt][1]=m,ans[cnt][2]=n-2*(n-x),ans[cnt][3]=m-2*(m-y);
	}
}
bool ck(int x,int l,int r)
{
	if(x==l || x==r)return 0;
	int mid=l+r>>1;
	if(x==mid)return 0;
	if((r-l)&1)return 1;
	if(x<mid)return ck(x,l,mid);return ck(x,mid,r);
}
int main()
{
	scanf("%d %d",&n,&m);
	scanf("%d %d",&ax,&ay);
	if(ck(ax,0,n) || ck(ay,0,m)){printf("-1\n");return 0;}
	slv(ax,ay);
	printf("%d\n",cnt);
	map<pair<int,int>,int>mp;
	mp[{0,0}]=mp[{0,m}]=mp[{n,0}]=mp[{n,m}]=1;
	for(int i=1;i<=cnt;i++)
	{
		assert(mp.count({ans[i][0],ans[i][1]}));
		assert(mp.count({ans[i][2],ans[i][3]}));
		mp[{ans[i][0]+ans[i][2]>>1,ans[i][1]+ans[i][3]>>1}]=1;
	}
	for(int i=1;i<=cnt;i++)printf("%d %d %d %d\n",ans[i][0],ans[i][1],ans[i][2],ans[i][3]);
	return 0;
}