import collections
import heapq


class Dijkstra:
    def __init__(self):
        self.e = collections.defaultdict(list)

    def add(self, u, v, d):
        self.e[u].append([v, d])

    def delete(self, u, v):
        self.e[u] = [_ for _ in self.e[u] if _[0] != v]
        self.e[v] = [_ for _ in self.e[v] if _[0] != u]

    def search(self, s):
        """
        :param s: 始点
        :return: 始点から各点までの最短経路
        """
        d = collections.defaultdict(lambda: float('inf'))
        d[s] = 0
        q = []
        heapq.heappush(q, (0, s))
        v = collections.defaultdict(bool)
        while len(q):
            k, u = heapq.heappop(q)
            if v[u]:
                continue
            v[u] = True

            for uv, ud in self.e[u]:
                if v[uv]:
                    continue
                vd = k + ud
                if d[uv] > vd:
                    d[uv] = vd
                    heapq.heappush(q, (vd, uv))

        return d

H,W = map(int, input().split())
U,D,R,L,K,P = map(int, input().split())
sx,sy,tx,ty = map(int, input().split())
sx-=1;sy-=1;tx-=1;ty-=1;
MAP = []
for i in range(H):
    MAP.append(input())
graph = Dijkstra()
for i in range(H):
    for j in range(W):
        if 0<=i-1<H and 0<=j<W:
            if MAP[i-1][j]=='.':
                graph.add((i,j,0),(i-1,j,0),U)
            if MAP[i-1][j]=='@':
                graph.add((i-1,j,1),(i-1,j,0),P)
                graph.add((i,j,0),(i-1,j,1),U)
        if 0<=i+1<H and 0<=j<W:
            if MAP[i+1][j]=='.':
                graph.add((i,j,0),(i+1,j,0),D)
            if MAP[i+1][j]=='@':
                graph.add((i+1,j,1),(i+1,j,0),P)
                graph.add((i,j,0),(i+1,j,1),D)
        if 0<=i<H and 0<=j+1<W:
            if MAP[i][j+1]=='.':
                graph.add((i,j,0),(i,j+1,0),R)
            if MAP[i][j+1]=='@':
                graph.add((i,j+1,1),(i,j+1,0),P)
                graph.add((i,j,0),(i,j+1,1),R)
        if 0<=i<H and 0<=j-1<W:
            if MAP[i][j-1]=='.':
                graph.add((i,j,0),(i,j-1,0),L)
            if MAP[i][j-1]=='@':
                graph.add((i,j-1,1),(i,j-1,0),P)
                graph.add((i,j,0),(i,j-1,1),L)
result = graph.search((sx,sy,0))
if result[(tx,ty,0)]<=K:
    print('Yes')
else:
    print('No')