from heapq import heappush, heappop
INF = float('inf')

x = [1, 0, 0, -1]
y = [0, 1, -1, 0]
H, W = map(int, input().split())
U, D, R, L, K, P = map(int, input().split())
cost = [D, R, L, U]
sx, sy, gx, gy = map(int, input().split())
sx-=1;sy-=1;gx-=1;gy-=1
C = [list(input()) for _ in range(H)]
adj = [list() for _ in range(H*W)]
for i in range(H):
    for j in range(W):
        if C[i][j] == '#':
            continue
        else:
            for cc, xx, yy in zip(cost, x, y):
                cx, cy = i+xx, j+yy
                if 0<=cx<H and 0<=cy<W:
                    if C[cx][cy] == '#':
                        continue
                    elif C[cx][cy] == '.':
                        adj[i*H+j].append((cx*H+cy, cc))
                    else:
                        adj[i*H+j].append((cx*H+cy, P+cc))

def dijkstra(s, n):
    dist = [INF] * n
    hq = [(0, s)] # (distance, node)
    dist[s] = 0
    seen = [False] * n # ノードが確定済みかどうか
    # 経路復元用
    # prev = [-1]*n
    while hq:
        dis, v = heappop(hq)
        if dist[v] < dis:
            continue
        seen[v] = True
        for to, cost in adj[v]:
            if seen[to] == False and dist[v] + cost < dist[to]:
                dist[to] = dist[v] + cost
                # prev[to] = v
                heappush(hq, (dist[to], to))
    return dist
d = dijkstra(sx*H+sy, H*W)
if d[gx*H+gy]<=K:
    print('Yes')
else:
    print('No')