#include<bits/stdc++.h>
//#include<atcoder/all>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace atcoder;
//using namespace boost::multiprecision;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const ll mod=1e9 + 7;
const ll LINF=1ll<<60;
const int INF=1<<30;
//int dx[]={0,1,0,-1,0,1,-1,1,-1};
//int dy[]={0,0,1,0,-1,1,-1,-1,1};
int dx[]={0,0,1,-1};
int dy[]={-1,1,0,0};


using PP = pair<ll, P>;

int main(){
    int h,w;cin >> h >> w;
    vector<ll> cost(4);
    for (int i = 0; i < 4; i++) {
        cin >> cost[i];
    }
    ll k,p;cin >> k >> p;
    int sy,sx,gy,gx;cin >> sy >> sx >> gy >> gx;
    sy--,sx--,gy--,gx--;
    vector<string> s(h);
    for (int i = 0; i < h; i++) {
        cin >> s[i];
    }
    priority_queue<PP, vector<PP>, greater<PP>> pq;
    pq.push({0, {sy, sx}});
    vector<vector<ll>> dp(h + 1, vector<ll> (w + 1, LINF));
    dp[sy][sx] = 0;
    while(not pq.empty()){
        ll C = pq.top().fs;
        int y = pq.top().sc.fs;
        int x = pq.top().sc.sc;
        pq.pop();
        if(dp[y][x] < C) continue;
        for (int i = 0; i < 4; i++) {
            int ny = y + dy[i], nx = x + dx[i];
            if(0 <= ny and ny < h and 0 <= nx and nx < w and s[ny][nx] != '#'){
                ll nc = C + cost[i] + (s[ny][nx] == '@') * p;
                if(chmin(dp[ny][nx], nc)){
                    pq.push({nc, {ny, nx}});
                }
            }
        }
    }
    if(dp[gy][gx] <= k) puts("Yes");
    else puts("No");
    return 0;
}