import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod, comb  #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
#from functools import lru_cache, reduce
from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


def main():
    mod = 10**9+7
    mod2 = 998244353
    h, w = map(int, input().split())
    u, d, r, l, k, p = map(int, input().split())
    x1, y1, x2, y2 = map(lambda x:int(x)-1, input().split())
    s = [list(input()) for i in range(h)]
    hq = [(x1, y1, 0)]
    heapify(hq)
    dist = [[-1]*w for i in range(h)]
    #dist[x1][y1]=0
    while hq:
        dists, nowh, noww = heappop(hq)
        if dist[nowh][noww] != -1:
            continue
        dist[nowh][noww] = dists
        for i, j, cost in [[0, 1, r], [1, 0, d], [0, -1, l], [-1, 0, u]]:
            if ((0 <= nowh+i < h) and (0 <= noww+j < w)):
                if s[nowh+i][noww+j] != '#':
                    if dist[nowh+i][noww+j] == -1:
                        heappush(hq, (dists+cost+p*int(s[nowh+i][noww+j] == '@'), nowh+i, noww+j))
    yn(0<=dist[x2][y2]<=k)
    #print(dist)


if __name__ == '__main__':
    main()