#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int h, w; cin>>h>>w;
    ll c[4];
    int dx[4]={-1, 1, 0, 0}, dy[4]={0, 0, 1, -1};
    for(int i=0; i<4; i++) cin>>c[i];
    ll k, p; cin>>k>>p;
    ll d[101][101];
    int xs, ys, xt, yt;
    cin>>xs>>ys>>xt>>yt;
    xs--; ys--; xt--; yt--;
    string s[101];
    for(int i=0; i<h; i++) cin>>s[i];
    const ll INF=1e18;
    for(int i=0; i<h; i++) for(int j=0; j<w; j++) d[i][j]=INF;
    d[xs][ys]=0;
    using Pl=pair<ll, P>;
    priority_queue<Pl, vector<Pl>, greater<Pl>> que;
    que.push({0, {xs, ys}});
    while(!que.empty()){
        auto q=que.top(); que.pop();
        int x=q.second.first, y=q.second.second;
        if(q.first>d[x][y]) continue;
        for(int i=0; i<4; i++){
            int x1=x+dx[i], y1=y+dy[i];
            if(x1<0 || x1>=h || y1<0 || y1>=w) continue;
            if(s[x1][y1]=='#') continue;
            ll cost=c[i];
            if(s[x1][y1]=='@') cost+=p;
            if(d[x1][y1]>d[x][y]+cost){
                d[x1][y1]=d[x][y]+cost;
                que.push({d[x1][y1], {x1, y1}});
            }
        }
    }
    //cout<<d[xt][yt]<<endl;
    if(d[xt][yt]<=k) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}