#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using namespace std;
typedef long long ll;

string g[50];
const int inf = 1e9;
int dist[50][50][5000];
int dy[] = {0, 1, 0, -1};
int dx[] = {1, 0, -1, 0};

int main() {
	int h, w;
	cin >> h >> w;
	int a, sy, sx;
	cin >> a >> sy >> sx;
	int b, gy, gx;
	cin >> b >> gy >> gx;
	rep (i, h) cin >> g[i];

	queue<tuple<int, int, int>> q;
	rep (i, 50) rep (j, 50) rep (k, 5000) dist[i][j][k] = inf;
	dist[sy][sx][a] = 0;
	q.emplace(sy, sx, a);
	while (!q.empty()) {
		int y, x, s;
		tie(y, x, s) = q.front(); q.pop();
		rep (k, 4) {
			int ny = y + dy[k];
			int nx = x + dx[k];
			if (ny < 0 || nx < 0 || ny >= h || nx >= w) continue;
			int delta;
			if (g[ny][nx] == '*') delta = 1;
			else delta = -1;
			if (s + delta == 0) continue;
			if (s + delta >= 5000) continue;
			if (chmin(dist[ny][nx][s + delta], dist[y][x][s] + 1)) {
				q.emplace(ny, nx, s + delta);
			}
		}
	}
	if (dist[gy][gx][b] < inf) {
		cout << "Yes" << endl;
	} else {
		cout << "No" << endl;
	}
	return 0;
}