#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep(i,n) for(int i = 0; i < (int)(n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define srep(i,s,t) for (int i = s; i < (t); ++i) #define dsrep(i,t,s) for(int i = (t)-1; i >= (s); --i) #define rng(a) a.begin(),a.end() #define rrng(a) a.rbegin(),a.rend() #define isin(x,l,r) ((l) <= (x) && (x) < (r)) int dx4[4]={1,0,-1,0}; int dy4[4]={0,-1,0,1}; using ll = long long; using uint = unsigned; using ull = unsigned long long; using P = pair; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; // const ll mod = 998244353; const ll mod = 1e9 + 7; /////////////////////////////////////////// ll h, w, k, pp, sx, sy, gx, gy; char c[105][105]; ll dist[105][105]; using PP = pair; ll cost_vec[4]; bool grid_inside(int y, int x) { if(0 <= y && y < h && 0 <= x && x < w) return true; else return false; } void dijkstra(int sx, int sy) { priority_queue, greater> que; dist[sx][sy] = 0; que.push(PP(0, P(sx, sy))); while (!que.empty()) { auto [cost, p] = que.top(); que.pop(); if(dist[p.first][p.second] < cost) continue; rep(i, 4) { int nx = dx4[i] + p.first, ny = dy4[i] + p.second; if(grid_inside(nx, ny) && (c[nx][ny] == '.' || c[nx][ny] == '@')) { ll tcost = dist[p.first][p.second] + cost_vec[i]; if(c[nx][ny] == '@') tcost += pp; if(dist[nx][ny] > tcost) { dist[nx][ny] = tcost; que.push(PP(dist[nx][ny], P(nx, ny))); } } } } } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> h >> w >> cost_vec[1] >> cost_vec[0] >> cost_vec[3] >> cost_vec[2] >> k >> pp >> sx >> sy >> gx >> gy; rep(i, h) rep(j, w) cin >> c[i][j]; rep(i, h) rep(j, w) dist[i][j] = LINF; sx--; sy--; gx--; gy--; dijkstra(sx, sy); cout << (dist[gx][gy] <= k ? "Yes" : "No") << endl; }