#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

template<class T>
void debug(vector<T> v, const char* sep) {
  const int n = v.size();
  fprintf(stderr, "'");
  for(int i=0; i<n; i++) {
    if(i!=0) { fprintf(stderr, "%s", sep); }
    cerr << v[i];
  }
  fprintf(stderr, "'\n");
}
template<class T> void debug(vector<T> v) { debug(v, " "); }
template<class T> void debug(vector<vector<T>> v) { int n = v.size(); for(int i=0; i<n; i++) { debug(v[i]); } }
template<class T> void debug(vector<vector<vector<T>>> v) { int n = v.size(); for(int i=0; i<n; i++) { debug(v[i]); } }
template<class T> void debug(vector<vector<vector<vector<T>>>> v) { int n = v.size(); for(int i=0; i<n; i++) { debug(v[i]); } }
template<class T> void debug(vector<vector<vector<vector<vector<T>>>>> v) { int n = v.size(); for(int i=0; i<n; i++) { debug(v[i]); } }

int R, C;
vector<string> G;
int a, b;
int sr, sc, gr, gc;
vector<vector<vector<int>>> dp;
vector<int> dr = {0, 0, 1, -1},
            dc = {1, -1, 0, 0};

int rec(int w, int r, int c) {
  int &res = dp[r][c][w];
  if(res != -1) { return res; }
  if(w == b && r == gr && c == gc) { return res = 1; }
  res = 0;
  for(int i : range(dr.size())) {
    int nr = r + dr[i],
        nc = c + dc[i];
    if(nr < 0 || R <= nr || nc < 0 || C <= nc) { continue; }
    int nw;
    if(G[nr][nc] == '.') {
      nw = w - 1;
    } else {
      nw = w + 1;
    }
    if(nw <= 0) { continue; }
    res |= rec(nw, nr, nc);
  }
  return res;
}

int main(void) {
  scanf("%d%d%d%d%d%d%d%d", &R, &C, &a, &sr, &sc, &b, &gr, &gc);
  G.resize(R);
  dp.assign(R, vector<vector<int>>(C, vector<int>(4000, -1)));
  for(int r : range(R)) { cin >> G[r]; }
  bool ok = rec(a, sr, sc);
  puts(ok ? "Yes" : "No");
  return 0;
}