#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <tuple>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int INF = 1e+18;
int h, w;
int cst[4];
int dy[4] = {-1, 1, 0, 0}; //U, D, R, L
int dx[4] = {0, 0, 1, -1};
int K, p;
int sy, sx, gy, gx;
string s[100];
int dp[100][100];

signed main() {
	int i, j;
	
	cin >> h >> w;
	cin >> cst[0] >> cst[1] >> cst[2] >> cst[3] >> K >> p;
	cin >> sy >> sx >> gy >> gx;
	sy--; sx--; gy--; gx--;
	rep(i, h) cin >> s[i];
	rep(i, h) rep(j, w) dp[i][j] = INF;
	
	typedef tuple<int, int, int> T;
	priority_queue<T, vector<T>, greater<T>> que;
	que.push(T(0, sy, sx));
	
	while (!que.empty()) {
		T now = que.top(); que.pop();
		int dist = get<0>(now);
		int y = get<1>(now);
		int x = get<2>(now);
		if (dp[y][x] <= dist) continue;
		dp[y][x] = dist;
		
		rep(i, 4) {
			int ny = y + dy[i];
			int nx = x + dx[i];
			int ndist = dist + cst[i];
			if (ny < 0 || ny >= h || nx < 0 || nx >= w) continue;
			if (s[ny][nx] == '#') continue;
			if (s[ny][nx] == '@') ndist += p;
			que.push(T(ndist, ny, nx));
		}
	}
	
	if (dp[gy][gx] > K) cout << "No" << endl;
	else cout << "Yes" << endl;
	return 0;
}