#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int H,W;
	cin>>H>>W;
	vector<ll> q(6);
	rep(i,6) cin>>q[i];
	vector<vector<int>> p(H+2,vector<int>(W+2,-1));
	int x1,x2,y1,y2;
	cin>>x1>>y1>>x2>>y2;
	rep(i,H) rep(j,W){
		char a;
		cin>>a;
		if(a=='@') p[i+1][j+1]=1;
		else if(a=='.') p[i+1][j+1]=0;
		else p[i+1][j+1]=-1;
	}
	_pq<tuple<ll,int,int>> pq;
	vector<vector<ll>> ans(H+2,vector<ll>(W+2,ILL));
	ans[x1][y1]=0;
	pq.push({0,x1,y1});
	vector<int> dx={-1,1,0,0};
	vector<int> dy={0,0,1,-1};
	while(!pq.empty()){
		ll c;
		int s,t;
		tie(c,s,t)=pq.top();
		pq.pop();
		if(ans[s][t]<c) continue;
		rep(i,4){
			int x=dx[i]+s;
			int y=dy[i]+t;
			if(p[x][y]==-1) continue;
			if(chmin(ans[x][y],q[i]+q[5]*p[x][y]+ans[s][t])){
				pq.push({ans[x][y],x,y});
			}
		}
	}
	/*cout<<ans[x2][y2]<<endl;
	cout<<q[5]<<endl;
	rep(i,H){
		rep(j,W){
			cout<<ans[i+1][j+1]<<" ";
		}
		cout<<endl;

	}*/
	yneos(q[4]>=ans[x2][y2]);
}