#include<iostream>
using namespace std;
int n,m,x,y;
int e[450][450];
int dx[8]={1,2,2,-1,-2,1};
int dy[8]={2,1,-1,2,1,-2};
struct stact{
	int x,y,step;
};
queue<stact>q;
void bfs()
{
	q.push({x,y,0});
	e[x][y]=1;
	while(!q.empty())
	{
		state head,tail;
		head=q.front();
		q.pop();
		for(int i=0;i<8;i++)	
		{
			
		}
	}
		
}
int main()
{
	cin>>n>>m>>x>>y;
	
}