#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;

//==============================================
int h, w, sy, sx, gy, gx;
vs M;
vector<vb>D;

bool bfs() {
	queue<pii> coord;
	coord.push(make_pair(sy, sx));
	D[sy][sx] = true;

	while (!coord.empty()) {
		pii now = coord.front(); coord.pop();
		const int y = now.first;
		const int x = now.second;
		const int nowH = M[y][x] - '0';

		if (gy == y && gx == x) return true;

		int ny, nx;
		REP(i, 4) {
			ny = y + dy[i];
			nx = x + dx[i];

			if (nx < 0 || w <= nx || ny < 0 || h <= ny) continue;
			if (D[ny][nx]) continue;
			if (abs(nowH - (M[ny][nx] - '0')) > 1) continue;

			D[ny][nx] = true;
			coord.push(make_pair(ny, nx));
		}
		REP(i, 4) {
			ny = y + dy[i] * 2;
			nx = x + dx[i] * 2;

			if (nx < 0 || w <= nx || ny < 0 || h <= ny) continue;
			if (D[ny][nx]) continue;

			const int ly = y + dy[i];
			const int lx = x + dx[i];

			if (nowH < M[ly][lx] - '0') continue;
			if (nowH != M[ny][nx] - '0') continue;

			D[ny][nx] = true;
			coord.push(make_pair(ny, nx));
		}
	}

	return false;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> h >> w >> sy >> sx >> gy >> gx;

	M.resize(h);
	D.resize(h, vb(w));
	sy--; sx--; gy--; gx--;

	REP(i, h) cin >> M[i];

	cout << (bfs() ? "YES\n" : "NO\n");
	return 0;
}