#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

struct State {
    int size;
    int y;
    int x;
    State() {}
    State(int size, int y, int x) : size(size), y(y), x(x) {}
};
bool done[2000][55][55];
string field[55];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int H, W;
    cin >> H >> W;
    int A, Si, Sj;
    cin >> A >> Si >> Sj;
    int B, Gi, Gj;
    cin >> B >> Gi >> Gj;
    for (int i = 0; i < H; i++) cin >> field[i];
    queue<State> que;
    que.push(State(A, Si, Sj));
    done[A][Si][Sj] = true;
    while (!que.empty()) {
        State s = que.front(); que.pop();
        for (int k = 0; k < 4; k++) {
            int ny = s.y+dy[k];
            int nx = s.x+dx[k];
            if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;
            int nsize = s.size;
            if (field[ny][nx] == '*') nsize++;
            else nsize--;
            if (nsize <= 0 || nsize >= 2000) continue;
            if (done[nsize][ny][nx]) continue;
            done[nsize][ny][nx] = true;
            que.push(State(nsize, ny, nx));
        }
    }
    if (done[B][Gi][Gj]) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}