#include<bits/stdc++.h>
using namespace std;
int n,m,sx,sy;
int tx[16025],ty[16025],head,tail;
int a[]={1,1,-1,-1,2,2,-2,-2};
int b[]={2,-2,2,-2,1,-1,1,-1};
int f[405][405];
bool judge(int x,int y){
	if(x<1||x>n||y<1||y>m||f[x][y]!=-1)return false;
	return true;
}
int main(){
	cin>>n>>m>>sx>>sy;
	memset(f,-1,sizeof(f));
	tx[tail]=sx;
	ty[tail]=sy;
	f[sx][sy]=0;
	tail++;
	while(head<tail){
		int x=tx[head];
		int y=ty[head];
		int bu=f[x][y];
		head++;
		
		for(int i=0;i<8;i++){
			int xx=x+a[i];
			int yy=y+b[i];
			if(judge(xx,yy)==false)continue;
			tx[tail]=xx;
			ty[tail]=yy;
			f[xx][yy]=bu+1;
			tail++;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cout<<f[i][j]<<" ";
		}
		cout<<"\n";
	}
	return 0;
}