import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int H, W, SX, SY, TX, TY;
int A, B;
string[] M;

int L;
bool[][][] vis;

void dfs(int x, int y, int a) {
  if (!vis[x][y][a]) {
    vis[x][y][a] = true;
    int aa;
    if (x + 1 < H) {
      aa = a + ((M[x + 1][y] == '*') ? +1 : -1);
      if (1 <= aa && aa < L) {
        dfs(x + 1, y, aa);
      }
    }
    if (y + 1 < W) {
      aa = a + ((M[x][y + 1] == '*') ? +1 : -1);
      if (1 <= aa && aa < L) {
        dfs(x, y + 1, aa);
      }
    }
    if (x - 1 >= 0) {
      aa = a + ((M[x - 1][y] == '*') ? +1 : -1);
      if (1 <= aa && aa < L) {
        dfs(x - 1, y, aa);
      }
    }
    if (y - 1 >= 0) {
      aa = a + ((M[x][y - 1] == '*') ? +1 : -1);
      if (1 <= aa && aa < L) {
        dfs(x, y - 1, aa);
      }
    }
  }
}

void main() {
  try {
    for (; ; ) {
      H = readInt();
      W = readInt();
      A = readInt();
      SX = readInt();
      SY = readInt();
      B = readInt();
      TX = readInt();
      TY = readInt();
      M = new string[H];
      foreach (x; 0 .. H) {
        M[x] = readToken();
      }
      L = max(A, B) + H * W;
      vis = new bool[][][](H, W, L);
      dfs(SX, SY, A);
      writeln(vis[TX][TY][B] ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}