#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#define chmax(a,b) a = max(a,b)
#define chmin(a,b) a = min(a,b)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 50
#define MAX 40
#else
#define SIZE 50
#define MAX 4000
#endif

int H,W;
bool DP[SIZE][SIZE][MAX];

struct Pos {
    int v,h,w;
};
Pos P[2];
int dxy[] = {1,0,-1,0,1};
string S[SIZE];

void solve() {
    cin>>H>>W;
    REP(i,2)cin>>P[i].v>>P[i].h>>P[i].w;
    REP(i,H)cin>>S[i];
    queue<Pos> que;
    que.push(P[0]);
    while(que.size()) {
        auto p = que.front();
        que.pop();
        REP(i,4) {
            int nh = p.h+dxy[i], nw = p.w+dxy[i+1];
            if (nh<0||nw<0||nh>=H||nw>=W) continue;
            int nv = p.v + (S[nh][nw]=='.' ? -1 : 1);
            if (nv <= 0 || MAX <= nv || DP[nh][nw][nv]) continue;
            debug("(%lld,%lld)->%lld\n",nh,nw,nv);
            DP[nh][nw][nv] = 1;
            que.push({nv,nh,nw});
        }
    }
    if (DP[P[1].h][P[1].w][P[1].v]) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}