#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

template<class T>
std::vector<unsigned long long> dijkstra(std::vector<std::vector<std::pair<int,T>>>& to, int s=0) {
    const unsigned long long INF = 1002003004005006007;
    struct QueElem {
        int v;
        unsigned long long c;
        bool operator<(const QueElem a) const {return c > a.c;}
        QueElem(int v, unsigned long long c): v(v), c(c) {}
    };
    std::priority_queue<QueElem> q;
    std::vector<unsigned long long> dist(to.size(), INF);
    dist[s] = 0;
    q.emplace(s, 0);
    while(!q.empty()) {
        QueElem qe = q.top(); q.pop();
        int u = qe.v;
        unsigned long long c = qe.c;
        if (c > dist[u]) continue;
        for(auto vc: to[u]) {
            int v = vc.first;
            unsigned long long nc = c + vc.second;
            if (nc < dist[v]) {
                dist[v] = nc;
                q.emplace(v, nc);
            }
        }
    }
    return dist;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int h, w;
    cin >> h >> w;
    int u, d, r, l, p;
    ll k;
    cin >> u >> d >> r >> l >> k >> p;
    int xs, ys, xt, yt;
    cin >> xs >> ys >> xt >> yt;
    xs--, ys--, xt--, yt--;
    vector<string> s(h);
    rep(i, h) cin >> s[i];
    vector<vector<P>> to(h * w);
    rep(i1, h - 1) rep(j, w) {
        int i2 = i1 + 1;
        if (s[i1][j] == '#' || s[i2][j] == '#') continue;
        int p1 = i1 * w + j, p2 = i2 * w + j;
        to[p1].emplace_back(p2, d + (s[i2][j] == '@' ? p : 0));
        to[p2].emplace_back(p1, u + (s[i1][j] == '@' ? p : 0));
    }
    rep(i, h) rep(j1, w - 1) {
        int j2 = j1 + 1;
        if (s[i][j1] == '#' || s[i][j2] == '#') continue;
        int p1 = i * w + j1, p2 = i * w + j2;
        to[p1].emplace_back(p2, r + (s[i][j2] == '@' ? p : 0));
        to[p2].emplace_back(p1, l + (s[i][j1] == '@' ? p : 0));
    }
    auto dist = dijkstra(to, xs * w + ys);
    cout << (dist[xt * w + yt] <= k ? "Yes" : "No") << '\n';
}