// yukicoder: 323 yuki国
// 2019.7.7 bal4u

#include <stdio.h>

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif
int in()    // 非負整数の入力
{
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void ins(char *s)  // 文字列の入力　スペース以下の文字で入力終了
{
	do *s = gc();
	while (*s++ > ' ');
	*(s-1) = 0;
}

#define QMAX 10000000
typedef struct { char r, c; int a; } Q;
Q q[QMAX+5]; int top, end;
int H, W, lim;
char map[53][53];
char vis[53][53][2002];
int mv[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};

int bfs(int sr, int sc, int gr, int gc, int A, int B) {
	int i, r, c, a, t, rr, cc;
	
	q[0].r = sr, q[0].c = sc, q[0].a = A, top = 0, end = 1;
	while (top != end) {
		r = q[top].r, c = q[top].c, a = q[top].a;
		if (++top == QMAX) top = 0;
//		printf("r=%d, c=%d, a=%d\n", r, c, a);
		if (r == gr && c == gc && a == B) return 1;
		if (a >= lim || vis[r][c][a]) continue;
		vis[r][c][a] = 1;
		for (i = 0; i < 4; i++) {
			rr = r + mv[i][0], cc = c + mv[i][1];
			if (rr < 0 || rr >= H || cc < 0 || cc >= W) continue;
			if ((t = (map[rr][cc] == '.')) && a == 1) continue;
			q[end].r = rr, q[end].c = cc, q[end].a = a + 1 - (t<<1);
			if (++end == QMAX) end = 0;
		}
	}
	return 0;
}
	
int main()
{
	int i, r, c, sr, sc, gr, gc, A, B;
	
	H = in(), W = in();
	A = in(), sr = in(), sc = in();
	B = in(), gr = in(), gc = in();
	for (r = 0; r < H; r++) ins(map[r]);
	lim = A; if (lim < B) lim = B;
	lim += H + W;
	puts(bfs(sr, sc, gr, gc, A, B)? "Yes": "No");
	return 0;
}