#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

#include <queue>

using T = tuple<ll, int, int>;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h, w;
    cin, h, w;
    ll cost[4];
    rep(i, 0, 4) {
        cin, cost[i];
    }
    ll k, p;
    cin, k, p;
    int xs, ys, xg, yg;
    cin, ys, xs, yg, xg;
    auto mp = make_v(h + 2, w + 2, '#');
    rep(i, 1, h + 1) {
        rep(j, 1, w + 1) {
            cin, mp[i][j];
        }
    }

    const ll inf = 1LL << 60;
    vector<ll> Cost((h + 2) * (w + 2), inf);
    priority_queue<T, vector<T>, greater<T>> pq;
    pq.emplace(0, xs, ys);

    auto index = [&](int x, int y) { return y * (w + 2) + x; };
    Cost[index(xs, ys)] = 0;

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

    while (pq.size()) {
        auto [c, x, y] = pq.top();
        pq.pop();
        int idx = index(x, y);
        if (Cost[idx] < c) continue;
        Cost[idx] = c;

        rep(t, 0, 4) {
            int nx = x + dx[t], ny = y + dy[t];
            int nidx = index(nx, ny);
            if (mp[ny][nx] == '#') continue;
            ll nc = c + cost[t];
            if (mp[ny][nx] == '@') {
                nc += p;
            }
            if (chmin(Cost[nidx], nc)) {
                pq.emplace(nc, nx, ny);
            }
        }
    }

    print(Cost[index(xg, yg)] <= k ? "Yes" : "No");

    return 0;
}