#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int H,W;
int A,B;
int sx,sy;
int gx,gy;
string board[55];
/*
inline bool OK(int x, int y) {
  return 0 <= x && x < H && 0 <= y && y < W;
}
*/
#define OK(x,y) (0 <= x && x < H && 0 <= y && y < W)
struct Q{
  int x,y,val;
  Q(int x_, int y_, int val_)
    : x(x_), y(y_), val(val_){}
};
bool passed[51][51][5010];
bool search(){
  int dx[] = {-1,0,0,1};
  int dy[] = {0,-1,1,0};
  queue <Q> que;
  que.push(Q(sx,sy,2500));
  passed[sx][sy][2500] = true;
  int target = B - A + 2500;
  int bound = 1 - A + 2500;
  while(!que.empty()){
    auto t = que.front();
    que.pop();
    auto x = t.x;
    auto y = t.y;
    auto val = t.val;
    if (x == gx && y == gy && val == target) {
      return true;
    }
    rep(i,4){
      auto nx = x + dx[i];
      auto ny = y + dy[i];
      if (OK(nx,ny)) {
        auto nval = val;
        if (board[nx][ny] == '.') {
          nval -= 1;
        }else{
          nval += 1;
        }
        if (bound <= nval && nval <= 5005 && !passed[nx][ny][nval]) {
          passed[nx][ny][nval] = true;
          que.push(Q(nx,ny,nval));
        }
      }
    }
  }
  return false;
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> H >> W;
  cin >> A >> sx >> sy;
  cin >> B >> gx >> gy;
  rep(i,H){
    cin >> board[i];
  }
  if (search()){
    cout << "Yes\n";
  }else{
    cout << "No\n";
  }

  return 0;
}