#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<ctime>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint1000000007;

int dh[] = {-1,0,1,0};
int dw[] = {0,1,0,-1};

vector<ll> dijkstra(int n,int s, vector<vector<Pi>> &G){
    vector<ll> dist(n,LINF);
    vector<bool> visited(n,false);
    priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> q;
    dist[s] = 0;
    visited[s] = true;
    q.push(make_pair(0,s));
    while(!q.empty()){
        auto p = q.top();
        ll p1 = p.first;
        int p2 = p.second;
        q.pop();
        if(p1 > dist[p2]) continue;
        visited[p2] = true;
        for(auto v : G[p2]){
            if(visited[v.first]) continue;
            if(dist[v.first] > dist[p2]+v.second){
                dist[v.first] = dist[p2]+v.second;
                q.push(make_pair(dist[v.first],v.first));
            }
        }
    }
    return dist;
}

int main(){
    int h,w; cin >> h >> w;
    ll u,d,r,l,k,p; cin >> u >> d >> r >> l >> k >> p;
    int xs,ys,xt,yt; cin >> xs >> ys >> xt >> yt;
    xs--; xt--; ys--; yt--;
    vector<string> s(h);
    rep(i,h) cin >> s[i];
    vector<vector<Pi>> G(h*w);
    rep(i,h)rep(j,w){
        if(s[i][j] == '#') continue;
        if(i < h-1){
            if(s[i+1][j] != '#'){
                G[i*w+j].emplace_back((i+1)*w+j,(s[i+1][j] == '.'?d:d+p));
                G[(i+1)*w+j].emplace_back(i*w+j,(s[i+1][j] == '.'?u:u+p));
            }
        }
        if(j < w-1){
            if(s[i][j+1] != '#'){
                G[i*w+j].emplace_back(i*w+j+1,(s[i][j+1] == '.'?r:r+p));
                G[i*w+j+1].emplace_back(i*w+j,(s[i][j+1] == '.'?l:l+p));
            }   
        }
    }
    vector<ll> dist = dijkstra(h*w,xs*w+ys,G);
    if(dist[xt*w+yt] <= k) cout << "Yes" << endl;
    else cout << "No" << endl;
}