#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)

using ll=long long;
using ld=long double;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int, int>;
using vpii=vector<pii>;

template<class T,class U>ostream&operator<<(ostream&os,const pair<T,U>p){os<<"("<<p.fst<<", "<<p.scd<<")";return os;}
template<class T>ostream&operator<<(ostream&os,const vector<T>v){rep(i,v.size()){if(i)os<<", ";os<<v[i];}return os;}
template<typename T>T&max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T&min(T&a,T&b){if(a < b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a < b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a > b){a=b;return true;}return false;}
int in(){int a;scanf("%d",&a);return a;}
ll lin(){ll a;scanf("%lld",&a);return a;}

constexpr int inf = 1e9;
constexpr ll linf = 3e18;
constexpr double eps = 1e-9;

typedef pair<int, pii> Data;

int dy[4] = {-1, 0, 1, 0};
int dx[4] = {0, -1, 0, 1};

int mp[52][52];
bool visited[3001][52][52];

int main()
{
    int H, W; scanf("%d%d", &H, &W);
    int A, sy, sx; scanf("%d%d%d", &A, &sy, &sx);
    int B, gy, gx; scanf("%d%d%d", &B, &gy, &gx);

    rep(i, H) {
        rep(j, W) {
            char c; scanf("\n%c", &c);
            if (c == '*') mp[i][j] = 1;
            else mp[i][j] = -1;
        }
    }

    queue<Data> q;
    q.push(Data(A, pii(sy, sx)));
    visited[A][sy][sx] = true;

    while (q.size()) {
        Data dat = q.front(); q.pop();

        int sz = dat.fst;
        pii p = dat.scd;

        rep(i, 4) {
            int ny = p.fst + dy[i], nx = p.scd + dx[i];
            int nsz = sz + mp[ny][nx];

            if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;
            if (nsz <= 0 || nsz > 3000) continue;
            if (visited[nsz][ny][nx]) continue;

            visited[nsz][ny][nx] = true;
            q.push(Data(nsz, pii(ny, nx)));
        }
    }

    puts(visited[B][gy][gx] ? "Yes" : "No");
}