#include using namespace std; typedef long long ll; int h, w; vector> field; vector> field_check; vector x; void dfs(int y, int x){ if (field_check[y][x]) return; else{ field_check[y][x] = 1; if (abs(field[y+1][x] - field[y][x]) <= 1) dfs(y+1, x); if (abs(field[y-1][x] - field[y][x]) <= 1) dfs(y-1, x); if (abs(field[y][x+1] - field[y][x]) <= 1) dfs(y, x+1); if (abs(field[y][x-1] - field[y][x]) <= 1) dfs(y, x-1); if (y < h && field[y+2][x] == field[y][x] && field[y+1][x] < field[y][x]) dfs(y+2, x); if (y > 1 && field[y-2][x] == field[y][x] && field[y-1][x] < field[y][x]) dfs(y-2, x); if (x < h && field[y][x+2] == field[y][x] && field[y][x+1] < field[y][x]) dfs(y, x+2); if (x > 1 && field[y][x-2] == field[y][x] && field[y][x-1] < field[y][x]) dfs(y, x-2); return; } } int main(){ int sy, sx, gy, gx, counter; char k; cin >> h >> w; cin >> sy >> sx >> gy >> gx; for (int i = 0; i < h+2; i++){ for (int i = 0; i < w + 2; i++) x.push_back(0); field_check.push_back(x); x.clear(); } for (int i = 0; i < w + 2; i++) x.push_back(-2); field.push_back(x); x.clear(); for (int i = 0; i < h; i++){ x.push_back(-2); for (int j = 0; j < w; j++){ cin >> k; x.push_back(k-48); } x.push_back(-2); field.push_back(x); x.clear(); } for (int i = 0; i < w + 2; i++) x.push_back(-2); field.push_back(x); // for (auto v : field){ // for (auto w : v) // cout << w; // cout << endl; // } dfs(sy, sx); // for (auto v : field_check){ // for (auto w : v) // cout << w; // cout << endl; // } cout << ( field_check[gy][gx] ? "YES" : "NO" ) << endl; return 0; }