#include <vector>
#include <iostream>
#include <queue>
#include <utility>
#include <string>
using namespace std;

#define ll long long

typedef struct edge{
	ll to;
	ll cost;
}Edge;
typedef pair<int,int> Pii;

long long INF=1000000000000000000;
int V;
vector<Edge> G[100000];
long long d[100000];

void dijkstra(int s){
  priority_queue<Pii,vector<Pii>,greater<Pii>> que;
	fill(d,d+V,INF);
	d[s]=0;
	que.push(Pii(0,s));
	while(!que.empty()){
		Pii p=que.top();que.pop();
		int v=p.second;
		if(d[v]<p.first)continue;
		for(unsigned int i=0;i<G[v].size();i++){
		  Edge e=G[v][i];
			if(d[e.to]>d[v]+e.cost){
			  d[e.to]=d[v]+e.cost;
				que.push(Pii(d[e.to],e.to));
			}
		}
	}
}

// ostream& operator<<(ostream& os,vector<Edge>& a){
//   for(Edge i:a){
//     os<<"to:"<<i.to<<",cost:"<<i.cost<<" ";
//   }
//   return os;
// }

int main(){
  ll H,W,U,D,R,L,K,P,xs,ys,xt,yt;
  cin>>H>>W>>U>>D>>R>>L>>K>>P>>xs>>ys>>xt>>yt;
  //cerr<<"P:"<<P<<endl;
  V=H*W;//また忘れてた
  U*=2;D*=2;R*=2;L*=2;K*=2;
  xs--;ys--;xt--;yt--;
  string s="";
  vector<string>C(H);
  for(int i=0;i<H;i++){
    cin>>C.at(i);
    C.at(i).append("#");
  }
  for(int i=0;i<W;i++)s.append("#");
  C.push_back(s);
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      if(C.at(i).at(j)=='#')continue;
      if(C.at(i).at(j)=='@'){
        if(C.at(i+1).at(j)=='.'){
          G[W*i+j].push_back({W*(i+1)+j,P+D});
          G[W*(i+1)+j].push_back({W*i+j,P+U});
        }else if(C.at(i+1).at(j)=='@'){
          G[W*i+j].push_back({W*(i+1)+j,2*P+D});
          G[W*(i+1)+j].push_back({W*i+j,2*P+U});
        }
        if(C.at(i).at(j+1)=='.'){
          G[W*i+j].push_back({W*i+j+1,P+R});
          G[W*i+j+1].push_back({W*i+j,P+L});
        }else if(C.at(i).at(j+1)=='@'){
          G[W*i+j].push_back({W*i+j+1,P+R});
          G[W*i+j+1].push_back({W*i+j,P+L});
        }
      }else{
        if(C.at(i+1).at(j)=='.'){
          G[W*i+j].push_back({W*(i+1)+j,D});
          G[W*(i+1)+j].push_back({W*i+j,U});
        }else if(C.at(i+1).at(j)=='@'){
          G[W*i+j].push_back({W*(i+1)+j,P+D});
          G[W*(i+1)+j].push_back({W*(i+1)+j,P+U});
        }
        if(C.at(i).at(j+1)=='.'){
          G[W*i+j].push_back({W*i+j+1,R});
          G[W*i+j+1].push_back({W*i+j,L});
        }else if(C.at(i).at(j+1)=='@'){
          G[W*i+j].push_back({W*i+j+1,P+R});
          G[W*i+j+1].push_back({W*i+j,P+L});
        }
      }
    }
  }
  dijkstra(W*xs+ys);
  if(d[W*xt+yt]<=K)cout<<"Yes\n";
  else cout<<"No\n";
  cerr<<"ans:"<<d[W*xt+yt]/2<<endl;
  // for(int i=0;i<V;i++){
  //   cerr<<"i:"<<i<<endl;
  //   cerr<<G[i]<<endl;
  //   cerr<<endl;
  // }
  return 0;
}