#include <stdio.h>

int h, w, a, si, sj, b, gi, gj;
char m[51][51];
int max_val[50][50], min_val[50][50];

int di[4] = {1, 0, -1,  0};
int dj[4] = {0, 1,  0, -1};

int max_search(int pi, int pj, int v, int is_pp) {
	if( ! (0 <= pi && pi < h && 0 <= pj && pj < w) ) { return 0; }
	if(m[pi][pj] == '*') { v++; } else { v--; }
	if(m[pi][pj] == '*' && is_pp) { return 1; }
	if(v <= max_val[pi][pj]) { return 0; }
	max_val[pi][pj] = v;
	
	int i, ret = 0;
	for(i = 0; i < 4; i++) {
		ret = max_search(pi + di[i], pj + dj[i], v, (m[pi][pj] == '*'));
		if(ret) { break; }
	}
	return ret;
}

void min_search(int pi, int pj, int v) {
	if( ! (0 <= pi && pi < h && 0 <= pj && pj < w) ) { return; }
	if(m[pi][pj] == '*') { v++; } else { v--; }
	if(v == 0) { v = 1; }
	if(min_val[pi][pj] != 0 && v >= min_val[pi][pj]) { return; }
	min_val[pi][pj] = v;
	
	int i;
	for(i = 0; i < 4; i++) {
		min_search(pi + di[i], pj + dj[i], v);
	}
	return;
}

int main(void) {
	scanf("%d%d%d%d%d%d%d%d%", &h, &w, &a, &si, &sj, &b, &gi, &gj);
	
	if( ((b - a) + (gi - si) + (gj - sj)) % 2 != 0 ) { printf("No\n"); return 0; }
	
	int i, j;
	for(i = 0; i < h; i++) {
		scanf("%s", m[i]);
	}
	
	int has_p = 0, has_m = 0;
	for(i = 0; i < h; i++) {
	for(j = 0; j < w; j++) {
		if( (m[i][j] == '*' && m[i][j + 1] == '*') || (m[i][j] == '*' && m[i + 1][j] == '*') ) { has_p = 1; }
		if( (m[i][j] == '.' && m[i][j + 1] == '.') || (m[i][j] == '.' && m[i + 1][j] == '.') ) { has_m = 1; }
	}
	}
	
	int c;
	if(m[si][sj] == '*') { c = -1; } else { c = 1; }
	
	int ans = 0;
	if( max_search(si, sj, a + c, 0) == 0 ) {
		if( (has_m && max_val[gi][gj] >= b) || (max_val[gi][gj] == b) ) { ans = 1; }
	} else {
		min_search(si, sj, (has_p ? 1 : a) + c);
		if(min_val[gi][gj] <= b) { ans = 1; }
	}
	
	printf("%s\n", (ans ? "Yes" : "No"));
	
	return 0;
}