#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
//#pragma GCC optimize("Ofast")
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    const vector<int> di = {-1, 1, 0, 0}, dj = {0, 0, 1, -1};
    cin>>H>>W;
    vec cost(4), dist(H * W, INF);
    rep(i, 4) cin>>cost[i];
    cin>>K>>M;
    int si, sj, ti, tj;
    cin>>si>>sj>>ti>>tj;
    --si; --sj; --ti; --tj;
    vector<string> G(H);
    rep(i, H) cin>>G[i];
    dist[si * W + sj] = 0;
    priority_queue<P, vector<P>, greater<> > pque;
    pque.emplace(0, si * W + sj);
    while(!pque.empty()){
        auto [d, v] = pque.top();
        pque.pop();
        int i = v / W, j = v % W;
        if(dist[v] < d) continue;
        rep(k, 4){
            int ni = i + di[k], nj = j + dj[k];
            if(ni >= 0 && ni < H && nj >= 0 && nj < W && G[ni][nj] != '#'
            && chmin(dist[ni * W + nj], d + cost[k] + (G[ni][nj] == '@' ? M : 0LL))){
                pque.emplace(dist[ni * W + nj], ni * W + nj);
            }
        }
    }
    cout<<(dist[ti * W + tj] <= K ? "Yes" : "No")<<endl;
}