小心TLE！！快来看看！！

#include<bits/stdc++.h>
using namespace std;
int n,m,x,y,dx[8]={1,1,2,2,-1,-1,-2,-2},dy[8]={2,-2,1,-1,2,-2,1,-1},l,r;
bool v[410][410];
struct node{
	int x,y,step;
};
int bfs(node s){
	queue<node> q;
	q.push(s);
	v[s.x][s.y]=1;
	while(!q.empty()){
		node t=q.front();
		q.pop();
		if(t.x==l&&t.y==r) return t.step;
		for(int i=0;i<8;i++){
			int nx=t.x+dx[i],ny=t.y+dy[i];
			if(v[nx][ny]==0&&nx<=n&&ny<=m&&nx>=1&&ny>=1){
				v[nx][ny]=1;
				q.push({nx,ny,t.step+1});
				
			}
		}
	}
	return -1;
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>n>>m>>x>>y;
	for(l=1;l<=n;l++){
		for(r=1;r<=m;r++){
			memset(v,0,sizeof(v));
			cout<<bfs({x,y,0})<<" ";
		}
		cout<<"\n";
	}
	return 0;
}