#include <stdio.h>

typedef struct {
	long long key;
	int id[2];
} data;
 
typedef struct {
	data obj[100000];
	int size;
} min_heap;
 
void push(data x, min_heap* h)
{
	int i = ++(h->size), j = i >> 1;
	data tmp;
	h->obj[i] = x;
	while (j > 0) {
		if (h->obj[i].key < h->obj[j].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j >>= 1;
		} else break;
	}
}

data pop(min_heap* h)
{
	int i = 1, j = 2;
	data output = h->obj[1], tmp;
	h->obj[1] = h->obj[(h->size)--];
	while (j <= h->size) {
		if (j < h->size && h->obj[j^1].key < h->obj[j].key) j ^= 1;
		if (h->obj[j].key < h->obj[i].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j = i << 1;
		} else break;
	}
	return output;
}

int main()
{
	int i, j, H, W, U, D, R, L, s[2], t[2];
	long long K, P;
	char C[102][102] = {};
	scanf("%d %d", &H, &W);
	scanf("%d %d %d %d %lld %lld", &U, &D, &R, &L, &K, &P);
	scanf("%d %d %d %d", &(s[0]), &(s[1]), &(t[0]), &(t[1]));
	for (i = 1; i <= H; i++) scanf("%s", &(C[i][1]));
	
	const long long sup = 1LL << 60;
	long long dist[101][101];
	min_heap h;
	data d;
	for (i = 1; i <= H; i++) for (j = 1; j <= W; j++) dist[i][j] = sup;
	h.size = 0;
	dist[s[0]][s[1]] = 0;
	d.key = 0;
	d.id[0] = s[0];
	d.id[1] = s[1];
	push(d, &h);
	while (h.size > 0) {
		d = pop(&h);
		i = d.id[0];
		j = d.id[1];
		if (d.key != dist[i][j]) continue;
		if (C[i-1][j] == '.') {
			if (dist[i-1][j] > dist[i][j] + U) {
				dist[i-1][j] = dist[i][j] + U;
				d.key = dist[i-1][j];
				d.id[0] = i - 1;
				d.id[1] = j;
				push(d, &h);
			}
		} else if (C[i-1][j] == '@') {
			if (dist[i-1][j] > dist[i][j] + U + P) {
				dist[i-1][j] = dist[i][j] + U + P;
				d.key = dist[i-1][j];
				d.id[0] = i - 1;
				d.id[1] = j;
				push(d, &h);
			}
		}
		if (C[i+1][j] == '.') {
			if (dist[i+1][j] > dist[i][j] + D) {
				dist[i+1][j] = dist[i][j] + D;
				d.key = dist[i+1][j];
				d.id[0] = i + 1;
				d.id[1] = j;
				push(d, &h);
			}
		} else if (C[i+1][j] == '@') {
			if (dist[i+1][j] > dist[i][j] + D + P) {
				dist[i+1][j] = dist[i][j] + D + P;
				d.key = dist[i+1][j];
				d.id[0] = i + 1;
				d.id[1] = j;
				push(d, &h);
			}
		}
		if (C[i][j-1] == '.') {
			if (dist[i][j-1] > dist[i][j] + L) {
				dist[i][j-1] = dist[i][j] + L;
				d.key = dist[i][j-1];
				d.id[0] = i;
				d.id[1] = j - 1;
				push(d, &h);
			}
		} else if (C[i][j-1] == '@') {
			if (dist[i][j-1] > dist[i][j] + L + P) {
				dist[i][j-1] = dist[i][j] + L + P;
				d.key = dist[i][j-1];
				d.id[0] = i;
				d.id[1] = j - 1;
				push(d, &h);
			}
		}
		if (C[i][j+1] == '.') {
			if (dist[i][j+1] > dist[i][j] + R) {
				dist[i][j+1] = dist[i][j] + R;
				d.key = dist[i][j+1];
				d.id[0] = i;
				d.id[1] = j + 1;
				push(d, &h);
			}
		} else if (C[i][j+1] == '@') {
			if (dist[i][j+1] > dist[i][j] + R + P) {
				dist[i][j+1] = dist[i][j] + R + P;
				d.key = dist[i][j+1];
				d.id[0] = i;
				d.id[1] = j + 1;
				push(d, &h);
			}
		}
	}
	
	if (dist[t[0]][t[1]] > K) printf("No\n");
	else printf("Yes\n");
	fflush(stdout);
	return 0;
}