# import sys
# #sys.setrecursionlimit(1000000)
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
import math
import bisect
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
import itertools
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e30)
mod = int(1e9+7)

import heapq
def dijkstra(start,edge):
    # edge[i] = [(distance, j), ...]
    dist = [inf]*len(edge)
    dist[start] = 0
    q = [(0, start)]
    while q:
        # u から　v　に辺を張る
        cost, u = heapq.heappop(q)
        if dist[u] < cost:continue
        for ncost, v in edge[u]:
            if (dist[u]+ncost) < dist[v]:
                dist[v] = dist[u]+ncost
                heapq.heappush(q, (dist[v], v))
    return dist

h,w = mp()
u,d,r,l,K,p = mp()
sx,sy,gx,gy = mp()
sx -= 1
sy -= 1
gx -= 1
gy -= 1
start = sx*h+sy
goal = gx*h+gy
grid = [input() for i in range(h)]
edge = [[] for i in range(h*w)]
mx = [1,0,-1,0]
my = [0,1,0,-1]
c = [d, r, u, l]
for i in range(h):
    for j in range(w):
        for k in range(4):
            nx,ny = i+mx[k], j+my[k]
            if 0 <= nx < h and 0 <= ny < w:
                if grid[nx][ny] == "#":continue
                if grid[nx][ny] == "@":
                    cost = c[k] + p
                else:
                    cost = c[k]
                edge[i*h+j].append((cost,nx*h+ny))
ans = dijkstra(start,edge)[goal]
if ans <= K:print("Yes")
else:print("No")