//#include <atcoder/modint>
#include <bits/stdc++.h>

using namespace std;
//using namespace atcoder;

constexpr long long INF_LL = 2000000000000000000LL;
constexpr int INF = 2000000000;
constexpr long long MOD = 1000000007;

#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<ll> vl;

int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
int sign[2] = {1, -1};

template <class T> bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}

ll modpow(ll a, ll b, ll m) {
    if(b == 0)
        return 1;
    ll t = modpow(a, b / 2, m);
    if(b & 1) {
        return (t * t % m) * a % m;
    } else {
        return t * t % m;
    }
}

struct edge {
    int to;
    ll cost;
    edge(int t, ll c) { to = t, cost = c; }
};

typedef vector<vector<edge>> graph;

// using mint = modint998244353;
// constexpr int MAX_COM = 0;
// mint fac[MAX_COM], ifac[MAX_COM];
// void initfac() {
//     fac[0] = ifac[0] = 1;
//     REP(i, 1, MAX_COM) fac[i] = i * fac[i - 1];
//     REP(i, 1, MAX_COM) ifac[i] = 1 / fac[i];
// }
// mint nCr(int n, int r){
//     if(r < 0 || n < r) return 0;
//     return fac[n] * ifac[n - r] * ifac[r];
// }

int main(){
    cin.tie(0);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(16);

    ll h, w, u, d, r, l, k, pp, sx, sy, tx, ty;
    cin >> h >> w >> u >> d >> r >> l >> k >> pp >> sx >> sy >> tx >> ty;
    vl dd = {r, u, l, d};
    vector<string> s(h + 2);
    rep(i, w + 2){
        s[0] += '#';
        s[h + 1] += '#';
    }
    rep(i, h) {
        string st;
        cin >> st;
        s[i + 1] = '#' + st + '#';
    }
    priority_queue<P, vector<P>, greater<P>> que;
    vector<vector<ll>> dist(h + 2, vector<ll>(w + 2, INF_LL));
    dist[sx][sy] = 0;
    w += 2;
    que.push(P(0, sx * w + sy));
    while(!que.empty()) {
        P p = que.top();
        que.pop();
        int v = p.second;
        int x = v / w, y = v % w;
        if(dist[x][y] < p.first)
            continue;
        rep(i, 4) {
            if(s[x + dx[i]][y + dy[i]] == '.'){
                if(dist[x + dx[i]][y + dy[i]] > dist[x][y] + dd[i]){
                    dist[x + dx[i]][y + dy[i]] = dist[x][y] + dd[i];
                    que.push({dist[x + dx[i]][y + dy[i]], (x + dx[i]) * w + y + dy[i]});
                }
            }else if(s[x + dx[i]][y + dy[i]] == '@'){
                if(dist[x + dx[i]][y + dy[i]] > dist[x][y] + dd[i] + pp){
                    dist[x + dx[i]][y + dy[i]] = dist[x][y] + dd[i] + pp;
                    que.push({dist[x + dx[i]][y + dy[i]], (x + dx[i]) * w + y + dy[i]});
                }
            }
        }
    }
    if(dist[tx][ty] <= k){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }
}