int n, m, x1, y1, x2, y2;
int x_move[8] = { 2, 1, -1, -2, -2, -1, 1, 2 };
int y_move[8] = { 1, 2, 2, 1, -1, -2, -2, -1 };
cin >> n >> m >> x1 >> y1 >> x2 >> y2;
vector<vector<int>> matrix(n, vector<int>(m));
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; j < m; j++) {
for (size_t k = 0; k < 8; k++) {
int next_i = i + x_move[k];
int next_j = j + y_move[k];
if (isInside(next_i, next_j, n, m, matrix))
matrix[next_i][next_j] = 1;
}
}
}