import heapq
h, w = map(int,input().split())
a, si, sj = map(int,input().split())
b, gi, gj = map(int,input().split())
m = [list(input()) for i in range(h)]

visited = [[[False] * 2500 for i in range(w)] for j in range(h)]

q = []
visited[si][sj][a] = True
heapq.heappush(q, (si, sj, a))

dx = [0, 1, 0,-1]
dy = [1, 0,-1, 0]

while len(q):
    curi, curj, cursize = heapq.heappop(q)

    for i in range(4):
        nexti = curi + dx[i]
        nextj = curj + dy[i]
        if 0 <= nexti < h and 0 <= nextj < w:
            pass
        else:
            continue

        if m[nexti][nextj] == "*":
            nextsize = cursize + 1
        else:
            nextsize = cursize - 1

        if 0 <= nextsize < 2500:
            pass
        else:
            continue

        if not visited[nexti][nextj][nextsize]:
            visited[nexti][nextj][nextsize] = True
            heapq.heappush(q,(nexti, nextj, nextsize))
            

if visited[gi][gj][b]:
    print("Yes")
else:
    print("No")