#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int H, W; cin >> H >> W;

    vector<ll> c(4);
    rep(i, 4) cin >> c[i];

    ll K, P; cin >> K >> P;

    vector<int> dx = {-1, 1, 0, 0}, dy = {0, 0, 1, -1};

    int sx, sy, tx, ty; cin >> sx >> sy >> tx >> ty; sx--, sy--, tx--, ty--;

    vector<string> S(H);
    rep(i, H) cin >> S[i];

    vector<vector<ll>> d(H, vector<ll>(W, INF));
    using T = tuple<ll, int, int>;
    priority_queue<T, vector<T>, greater<T>> que;
    que.emplace(d[sx][sy] = 0, sx, sy);

    while(!empty(que)){
        auto [p, x, y] = que.top(); que.pop();
        if(p > d[x][y]) continue;
        rep(k, 4){
            int nx = x+dx[k], ny = y+dy[k];
            ll np = p+c[k];
            if(nx < 0 || nx >= H || ny < 0 || ny >= W || S[nx][ny] == '#') continue;
            if(S[nx][ny] == '@') np += P;
            if(chmin(d[nx][ny], np)){
                que.emplace(np, nx, ny);
            }
        }
    }

    cout << (d[tx][ty] <= K? "Yes\n" : "No\n");
}