h,w = map(int,input().split()) u,d,r,l,k,p = map(int,input().split()) sx,sy,gx,gy = map(int,input().split()) b = [input() for _ in range(h)] sx -= 1 sy -= 1 gx -= 1 gy -= 1 C = [r,d,l,u] dx = [1,0,-1,0] dy = [0,1,0,-1] INF = 10**18 dist = [[INF]*w for _ in range(h)] from heapq import * q = [(0,sx,sy)] while q: dv,x,y = heappop(q) if dist[x][y] < dv: continue for i in range(4): nx = x + dx[i] ny = y + dy[i] if nx < 0 or nx >= h or ny < 0 or ny >= w or b[nx][ny] == "#": continue cost = dv + C[i] if b[nx][ny] == "@": cost += p if cost < dist[nx][ny]: heappush(q, (cost,nx,ny)) dist[nx][ny] = cost print("Yes" if dist[gx][gy] <= k else "No")