import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    h, w = MI()
    a, si, sj = MI()
    b, gi, gj = MI()
    t = [[1 if c == "*" else -1 for c in SI()] for _ in range(h)]
    fin = [[0] * w for _ in range(h)]
    lim = max(a, b) + h + w
    stack = [(si, sj, a)]
    fin[si][sj] = 1 << a
    while stack:
        i, j, s = stack.pop()
        for di, dj in dij:
            ni, nj = i + di, j + dj
            if not 0 <= ni < h: continue
            if not 0 <= nj < w: continue
            ns = s + t[ni][nj]
            if (ni, nj, ns) == (gi, gj, b):
                print("Yes")
                exit()
            if not 0 < ns <= lim: continue
            if fin[ni][nj] >> ns & 1: continue
            fin[ni][nj] |= 1 << ns
            stack.append((ni, nj, ns))
    print("No")

main()