代码如下：

#include <bits/stdc++.h>
using namespace std;
queue<pair<int, int>> q;
int ans[310][310];
int dis[8][2] = {{2, 1}, {1, 2}, {-1, 2}, {-2, 1}, {-2, -1}, {-1, -2}, {1, -2}, {2, -1}};
int main() {
	int n, m, x, y;
	scanf("%d%d%d%d", &n, &m, &x, &y);
	memset(ans, -1, sizeof(ans));
	ans[x][y] = 0;
	q.push(make_pair(x, y));
	while (!q.empty()) {
		pair<int, int> cur = q.front();
		q.pop();
		for (int k = 0; k < 8; k++) {
			int newx = cur.first + dis[k][0], newy = cur.second + dis[k][1];
			if (newx < 1 || newx > n || newy < 1 || newy > m || ans[newx][newy] != -1) continue;
			ans[newx][newy] = ans[cur.first][cur.second] + 1;
			q.push(make_pair(newx, newy));
		}
	}
	for (int i = 0; i < n; i++, puts(""))
		for (int j = 0; j < m; j++)
			printf("%5d", ans[i][j]);
	return 0;
}