#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
using namespace std;
int n,m,x_1,y_1;
int a[410][410];
const int dx[9]={0,-2,-1,1,2,-2,-1,1,2};
const int dy[9]={0,1,2,2,1,-1,-2,-2,-1};
struct node
{
	int x,y;
}s[200000];
void bfs()
{
	int head=0,tail=1;
	s[tail].x=x_1,s[tail].y=y_1;
	a[x_1][y_1]=0;
	do{
		head++;
		for(int i=1;i<=8;i++)
		{
			int xx=s[head].x+dx[i];
			int yy=s[head].y+dy[i];
			if(a[xx][yy]==-1&&xx>=1&&xx<=n&&yy>=1&&yy<=m) 
	        {
	        	tail++;
	        	s[tail].x=xx;s[tail].y=yy;
	        	a[xx][yy]=a[s[head].x][s[head].y]+1;
	        }
	    }
	   }while(head!=tail);
}
int main()
{
	cin>>n>>m>>x_1>>y_1;
	memset(a,-1,sizeof(a));
	bfs();
	for(int i=1;i<=n;i++)
	{
	    for(int j=1;j<=m;j++)
	        cout<<a[i][j]<<" ";
	    cout<<endl;
	}
	return 0;
}