#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;

// N, E, S, W
const int dx[] = { 1, 0, -1, 0};
const int dy[] = { 0, 1, 0, -1};

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, sx, sy, gx, gy;
vs M;
vvi D;

int func(string s, int a) {
	string r;
	r = s[a];

	if (r == "#") {
		r = "9999";
	}
	return stoi(r);
}

bool bfs() {
	queue<pii> coord;
	coord.push(make_pair(sy, sx));

	D[sy][sx] = true;

	while (!coord.empty()) {
		const pii now = coord.front(); coord.pop();
		int nowx = now.second;
		int nowy = now.first;

		REP(i, 4) {
			int nextx = nowx + dx[i];
			int nexty = nowy + dy[i];

			if (nextx < 0 || w <= nextx) continue;
			if (nexty < 0 || h <= nexty) continue;

			if (D[nexty][nextx]) continue;
			bool flag = false;
			if (M[nexty][nextx] == M[nowy][nowx]) {
				flag = true;
			} else if (func(M[nexty], nextx) == func(M[nowy], nowx) + 1) {
				flag = true;
			} else if (func(M[nexty], nextx) == func(M[nowy], nowx) - 1) {
				flag = true;
			} else {
				if (dy[i] == 1) {
					if (nexty + 1 < 0 || h <= nexty + 1) flag = true;
				} else if (dy[i] == -1) {
					if (nexty - 1 < 0 || h <= nexty - 1) flag = true;
				} else if (dx[i] == 1) {
					if (nextx + 1 < 0 || w <= nextx + 1) flag = true;
				} else if (dx[i] == -1) {
					if (nextx - 1 < 0 || w <= nextx - 1) flag = true;
				}

				if (flag) {
					D[nexty][nextx] = true;
					if (D[gy][gx]) return true;
					coord.push(make_pair(nexty, nextx));

					flag = false;

				}
			}

			if (flag) {

				D[nexty][nextx] = true;
				if (D[gy][gx]) return true;
				coord.push(make_pair(nexty, nextx));

				flag = false;
			}
		}
	}

	return false;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> h >> w >> sy >> sx >> gy >> gx;
	sx--; sy--; gx--; gy--;

	D.resize(h, vi(w));
	M.resize(h);

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

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