#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define ALL(a) (a).begin(), (a).end()
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    int h, w;
    cin >> h >> w;
    int u, d, r, l, k, p;
    cin >> u >> d >> r >> l >> k >> p;
    int xs, ys, xt, yt;
    cin >> xs >> ys >> xt >> yt;
    xs--, ys--, xt--, yt--;
    vc<string> C;
    vvc<int> cost(h, vc<int>(w, 1LL << 30));
    rep(i, h) {
        string g;
        cin >> g;
        C.push_back(g);
    }
    cost[xs][ys] = 0;
    queue<pair<pi, int>> que;
    que.push(make_pair(pi(xs, ys), cost[xs][ys]));
    while (!que.empty()) {
        auto [point, c] = que.front();
        que.pop();
        auto [px, py] = point;
        int nx, ny;
        nx = px - 1, ny = py;
        if (0 <= nx && nx < h && 0 <= ny && ny < w) {
            if (C[nx][ny] == '.') {
                int tmpc = c + u;
                if (cost[nx][ny] > tmpc) {
                    cost[nx][ny] = tmpc;
                    que.push(make_pair(pi(nx, ny), cost[nx][ny]));
                }
            }
            if (C[nx][ny] == '@') {
                int tmpc = c + u + p;
                if (cost[nx][ny] > tmpc) {
                    cost[nx][ny] = tmpc;
                    que.push(make_pair(pi(nx, ny), cost[nx][ny]));
                }
            }
        }
        nx = px + 1, ny = py;
        if (0 <= nx && nx < h && 0 <= ny && ny < w) {
            if (C[nx][ny] == '.') {
                int tmpc = c + d;
                if (cost[nx][ny] > tmpc) {
                    cost[nx][ny] = tmpc;
                    que.push(make_pair(pi(nx, ny), cost[nx][ny]));
                }
            }
            if (C[nx][ny] == '@') {
                int tmpc = c + d + p;
                if (cost[nx][ny] > tmpc) {
                    cost[nx][ny] = tmpc;
                    que.push(make_pair(pi(nx, ny), cost[nx][ny]));
                }
            }
        }
        nx = px, ny = py - 1;
        if (0 <= nx && nx < h && 0 <= ny && ny < w) {
            if (C[nx][ny] == '.') {
                int tmpc = c + l;
                if (cost[nx][ny] > tmpc) {
                    cost[nx][ny] = tmpc;
                    que.push(make_pair(pi(nx, ny), cost[nx][ny]));
                }
            }
            if (C[nx][ny] == '@') {
                int tmpc = c + l + p;
                if (cost[nx][ny] > tmpc) {
                    cost[nx][ny] = tmpc;
                    que.push(make_pair(pi(nx, ny), cost[nx][ny]));
                }
            }
        }
        nx = px, ny = py + 1;
        if (0 <= nx && nx < h && 0 <= ny && ny < w) {
            if (C[nx][ny] == '.') {
                int tmpc = c + r;
                if (cost[nx][ny] > tmpc) {
                    cost[nx][ny] = tmpc;
                    que.push(make_pair(pi(nx, ny), cost[nx][ny]));
                }
            }
            if (C[nx][ny] == '@') {
                int tmpc = c + r + p;
                if (cost[nx][ny] > tmpc) {
                    cost[nx][ny] = tmpc;
                    que.push(make_pair(pi(nx, ny), cost[nx][ny]));
                }
            }
        }
    }
    if (cost[xt][yt] <= k) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}