#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
const int dx[] = { -1,1,0,0 };
const int dy[] = { 0,0,1,-1 };
int c[4];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int h, w; cin >> h >> w;
	rep(i, 4)cin >> c[i];
	long long k, p; cin >> k >> p;
	int sx, sy, ex, ey; cin >> sx >> sy >> ex >> ey;
	sx--; sy--; ex--; ey--;
	vector<string>s(h);
	rep(i, h)cin >> s[i];
	{//dijkstra
		vector<vector<long long>> d(h, vector<long long>(w, LINF));
		priority_queue<pair<long long, P>, vector<pair<long long, P>>, greater<pair<long long, P>>> q;
		q.push({ 0, { sx, sy } });
		d[sx][sy] = 0;
		while (!q.empty()) {
			auto t = q.top();
			long long cost = t.first;
			int x = t.second.first;
			int y = t.second.second;
			q.pop();
			if (cost > d[x][y]) continue;
			rep(i, 4) {
				int nx = x + dx[i];
				int ny = y + dy[i];
				if ((0 <= nx) && (h > nx) && (0 <= ny) && (w > ny) && ('#' != s[nx][ny])) {
					long long ncost = cost + c[i];
					if ('@' == s[nx][ny]) ncost += p;
					if (chmin(d[nx][ny], ncost)) {
						q.push({ ncost, { nx, ny } });
					}
				}
			}
		}
		if (d[ex][ey] <= k)cout << "Yes" << endl;
		else cout << "No" << endl;
		//cout << d[ex][ey] << endl;
	}
	return 0;
}