#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 2000000
#define MOD 1000000007
#define INF 1000000000000000000

int di[4]={1,0,-1,0};
int dj[4]={0,1,0,-1};

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--;ys--;xt--;yt--;
  vector<vector<char>> C(H,vector<char>(W));
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      cin>>C[i][j];
    }
  }

  vector<vector<ll>> dist(H,vector<ll>(W,INF));
  ll cost[4]={D,R,U,L};
  priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;
  dist[xs][ys]=0;
  pq.push(make_pair(dist[xs][ys],xs*W+ys));
  while(!pq.empty()){
    int i=pq.top().second/W;
    int j=pq.top().second%W;
    ll d=pq.top().first;
    pq.pop();
    if(dist[i][j]<d){
      continue;
    }
    for(int k=0;k<4;k++){
      int ni=i+di[k];
      int nj=j+dj[k];
      if(ni<0||nj<0||ni>=H||nj>=W){
        continue;
      }
      if(C[ni][nj]=='#'){
        continue;
      }
      if(C[ni][nj]=='.'){
        if(dist[ni][nj]>dist[i][j]+cost[k]){
          dist[ni][nj]=dist[i][j]+cost[k];
          pq.push(make_pair(dist[ni][nj],ni*W+nj));
        }
      }else{
        if(dist[ni][nj]>dist[i][j]+cost[k]+P){
          dist[ni][nj]=dist[i][j]+cost[k]+P;
          pq.push(make_pair(dist[ni][nj],ni*W+nj));
        }
      }
    }
  }
  //cout<<dist[xt][yt]<<'\n';
  if(dist[xt][yt]<=K){
    cout<<"Yes"<<'\n';
  }else{
    cout<<"No"<<'\n';
  }
}