#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<climits>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m;
int x,y;
struct p{
	int x;
	int y;
	int k;
};
p a[100086];
bool l[10006][10005];
int b[1086][10010];
int dx[]={-1,-2,-2,-1,1,2,2,1},
	dy[]={-2,-1,1,2,2,1,-1,-2};
void bfs(int n,int m){
	int head=0;
	int tail=1;
	a[tail].x=x;
	a[tail].y=y;
	a[tail].k=0;
	while(head<tail){
		head++;
		for(int i=0;i<8;i++){
			int xx=a[head].x+dx[i];
			int yy=a[head].y+dy[i];
			if(xx>=0&&yy>=0&&xx<=n&&yy<=m&&!l[xx][yy]){
				tail++;
				a[tail].x=xx;
				a[tail].y=yy;
				a[tail].k=a[head].k+1;
				l[xx][yy]=1;
//				if(b[xx][yy]>0){
//					b[xx][yy]=min(b[xx][yy],a[tail].k);
//				}else{
					b[xx][yy]=a[tail].k;
//				}
				
				if(xx==n&&yy==m){
//					if(b[xx][yy]>0){
//						b[xx][yy]=min(b[xx][yy],a[tail].k);
//					}else{
						b[xx][yy]=a[tail].k;
//					}
					return;
				}
			}
		}
	}
}
int main(){
	cin>>n>>m;
	cin>>x>>y;
	memset(b,-1,sizeof(b));
	bfs(n,m);
	b[x][y]=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cout<<b[i][j]<<" ";
		}
		cout<<endl;
	}
	return 0;
}