#include <bits/stdc++.h>


#include <algorithm>
#include <cassert>
#include <vector>

template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}

template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

template <typename T>
struct CoordComp {
    std::vector<T> v;
    bool sorted;

    CoordComp() : sorted(false) {}

    int size() { return v.size(); }

    void add(T x) { v.push_back(x); }

    void build() {
        std::sort(v.begin(), v.end());

        v.erase(std::unique(v.begin(), v.end()), v.end());
        sorted = true;
    }

    int get_idx(T x) {
        assert(sorted);
        return lower_bound(v.begin(), v.end(), x) - v.begin();
    }

    T &operator[](int i) { return v[i]; }
};


#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For(i, 0, n)
#define rrep(i, n) rFor(i, n, 0)
#define fi first
#define se second

using namespace std;

using lint = long long;
using pii = pair<int, int>;
using pll = pair<lint, lint>;

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

struct state {
    int x, y;
    lint d;

    state(int x, int y, lint d) : x(x), y(y), d(d) {}
};

int main() {
    int h, w;
    scanf("%d%d", &h, &w);
    rep(i, 4) scanf("%d", &cost[i]);
    lint K, P;
    scanf("%lld%lld", &K, &P);
    int sx, sy, gx, gy;
    scanf("%d%d%d%d", &sx, &sy, &gx, &gy);
    --sx;
    --sy;
    --gx;
    --gy;
    char c[h][w];
    rep(i, h) rep(j, w) scanf(" %c", &c[i][j]);

    lint dist[h][w];
    rep(i, h) rep(j, w) dist[i][j] = LLONG_MAX;
    dist[sx][sy] = 0;
    auto cmp = [](const state &s1, const state &s2) { return s1.d > s2.d; };
    priority_queue<state, vector<state>, decltype(cmp)> que(cmp);
    que.push({sx, sy, 0});
    while (!que.empty()) {
        auto [x, y, d] = que.top();
        que.pop();
        if (d > dist[x][y]) continue;
        rep(i, 4) {
            int nx = x + dx[i], ny = y + dy[i];
            if (0 <= nx && nx < h && 0 <= ny && ny < w && c[nx][ny] != '#') {
                lint nd = d + cost[i] + (c[nx][ny] == '@' ? P : 0);
                if (chmin(dist[nx][ny], nd)) {
                    que.push({nx, ny, nd});
                }
            }
        }
    }
    puts(dist[gx][gy] <= K ? "Yes" : "No");
    // cout << dist[gx][gy] << endl;
}