#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 1.5e3 + 5, kMaxT = kMaxN * kMaxN;

int n, m, len1, len2, xh, yh, xv, yv, xt, yt;
int pre1[kMaxN][kMaxN], pre2[kMaxN][kMaxN], nxt1[kMaxN][kMaxN], nxt2[kMaxN][kMaxN];
int l1[kMaxN][kMaxN], r1[kMaxN][kMaxN], l2[kMaxN][kMaxN], r2[kMaxN][kMaxN], fa[kMaxT];
std::string s[kMaxN];

int getid(int x, int y) { return (x - 1) * m + y; }

int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
void unionn(int x, int y) {
  int fx = find(x), fy = find(y);
  if (fx != fy) fa[fx] = fy;
}

void prework() {
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      if (s[i][j] == 'X') {
        pre1[i][j] = i, pre2[i][j] = j;
      } else {
        pre1[i][j] = pre1[i - 1][j];
        pre2[i][j] = pre2[i][j - 1];
      }
    }
  }
  for (int i = n; i; --i) {
    for (int j = m; j; --j) {
      if (s[i][j] == 'X') {
        nxt1[i][j] = i, nxt2[i][j] = j;
      } else {
        nxt1[i][j] = nxt1[i + 1][j];
        nxt2[i][j] = nxt2[i][j + 1];
        if (!nxt1[i][j]) nxt1[i][j] = n + 1;
        if (!nxt2[i][j]) nxt2[i][j] = m + 1;
      }
    }
  }

  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      l1[i][j] = std::max(pre1[i][j] + 1, i - len1 + 1);
      r1[i][j] = std::min(nxt1[i][j] - len1, i);
      l2[i][j] = std::max(pre2[i][j] + 1, j - len2 + 1);
      r2[i][j] = std::min(nxt2[i][j] - len2, j);
      // if (l1[i][j] <= r1[i][j] && l2[i][j] <= r2[i][j]) {
      //   std::cerr << "??? " << i << ' ' << j << ' ' << l1[i][j] << ' ' << r1[i][j] << ' ' << l2[i][j] << ' ' << r2[i][j] << '\n';
      //   std::cerr << "!!! " << i << ' ' << j << ' ' << pre1[i][j] << ' ' << nxt1[i][j] << ' ' << pre2[i][j] << ' ' << nxt2[i][j] << '\n';
      // }
    }
  }
}

void dickdreamer() {
  std::cin >> n >> m >> len1 >> len2;
  std::cin >> xh >> yh >> xv >> yv;
  std::swap(n, m), std::swap(len1, len2), std::swap(xh, yh), std::swap(xv, yv);
  ++xh, ++yh, ++xv, ++yv;
  for (int i = 1; i <= n; ++i) {
    std::cin >> s[i];
    s[i] = " " + s[i];
    for (int j = 1; j <= m; ++j) {
      if (s[i][j] == '*') {
        xt = i, yt = j;
      }
    }
  }
  prework();
  for (int i = 1; i <= n * m; ++i) fa[i] = i;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      if (i < n) {
        if (std::max(l1[i][j], l1[i][j + 1]) <= std::min(r1[i][j], r1[i][j + 1]) && 
            std::max(l2[i][j], l2[i][j + 1]) <= std::min(r2[i][j], r2[i][j + 1])) {
          unionn(getid(i, j), getid(i + 1, j));
        }
      }
      if (j < m) {
        if (std::max(l1[i][j], l1[i][j + 1]) <= std::min(r1[i][j], r1[i][j + 1]) && 
            std::max(l2[i][j], l2[i][j + 1]) <= std::min(r2[i][j], r2[i][j + 1])) {
          unionn(getid(i, j), getid(i, j + 1));
        }
      }
    }
  }
  // std::cerr << xh << ' ' << yv << ' ' << xt << ' ' << yt << ' ' << find(getid(xh, yv)) << ' ' << find(getid(xt, yt)) << '\n';
  std::cout << (find(getid(xh, yv)) == find(getid(xt, yt)) ? "YES\n" : "NO\n");
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}