#include <bits/stdc++.h>
using namespace std;
int ma[10010][10010];
int n,m,x,y;
int xx[8]={-1,-2,-2,-1,1,2,2,1};int yy[8]={2,1,-1,-2,2,1,-1,-2};
void dfs(int x,int y,int num){
	ma[x][y]=num;
	for(int i=0;i<8;i++){
		int dx=x+xx[i];int dy=y+yy[i];
		if(dx>=0&&dx<=n&&dy>=0&&dy<=m&&ma[dx][dy]>num){
			dfs(dx,dy,num+1);
		}
	}
}
int main(){
	cin>>n>>m>>x>>y;
	dfs(x,y,0);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(ma[i][j]==0)cout<<-1<<" ";
			else if(i==x&&j==y) cout<<0;
			else cout<<ma[i][j];
		}
		cout<<endl;
	}
}

输出的全是-1