mod = 1000000007 eps = 10**-9 def main(): import sys input = sys.stdin.readline import heapq def dijkstra(adj, start): # adj: [[to, cost] * vertices], 0th index must be empty inf = 1 << 60 dist = [inf] * len(adj) dist[start] = 0 q = [] heapq.heappush(q, (0, start)) while q: min_dist, v_from = heapq.heappop(q) if min_dist > dist[v_from]: continue v_tos = adj[v_from] for v_to, cost in v_tos: if min_dist + cost < dist[v_to]: dist[v_to] = min_dist + cost heapq.heappush(q, (dist[v_to], v_to)) return dist H, W = map(int, input().split()) U, D, R, L, K, P = map(int, input().split()) adj = [[] for _ in range(H * W + 1)] hs, ws, ht, wt = map(int, input().split()) grid = [] for _ in range(H): grid.append(input().rstrip('\n')) for h in range(H): for w in range(W-1): hw = h*W + w + 1 # R if grid[h][w+1] == ".": adj[hw].append((hw+1, R)) elif grid[h][w+1] == "@": adj[hw].append((hw+1, R+P)) # L if grid[h][w] == ".": adj[hw+1].append((hw, L)) elif grid[h][w] == "@": adj[hw+1].append((hw, L+P)) for w in range(W): for h in range(H-1): hw = h*W + w + 1 # D if grid[h + 1][w] == ".": adj[hw].append((hw + W, D)) elif grid[h + 1][w] == "@": adj[hw].append((hw + W, D + P)) # U if grid[h][w] == ".": adj[hw + W].append((hw, U)) elif grid[h][w] == "@": adj[hw + W].append((hw, U + P)) hs -= 1 ht -= 1 ws -= 1 wt -= 1 hw_s = hs*W + ws + 1 hw_t = ht*W + wt + 1 ans = dijkstra(adj, hw_s)[hw_t] if ans <= K: print("Yes") else: print("No") if __name__ == '__main__': main()