#include <bits/stdc++.h>
using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cpx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound(ALL(v), x) - (v).begin())
#define ubv(v, x) (upper_bound(ALL(v), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <typename T, typename U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}

const pii MOVES[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int MN = 1505;
int n, m;
int k1, k2;
string grid[MN];
int lrr[MN][MN], rrr[MN][MN], urr[MN][MN], drr[MN][MN];
bool vis[MN][MN];
pii qu[MN*MN];
int ql, qr;

void preProc(){
    FR(x, n){
        lrr[x][0] = 0;
        FOR(y, 1, m) lrr[x][y] = grid[x][y-1] == 'X' ? y : lrr[x][y-1];
        rrr[x][m-1] = m-1;
        FORR(y, m-2, 0) rrr[x][y] = grid[x][y+1] == 'X' ? y : rrr[x][y+1];
    }
    FR(y, m){
        urr[0][y] = 0;
        FOR(x, 1, n) urr[x][y] = grid[x-1][y] == 'X' ? x : urr[x-1][y];
        drr[n-1][y] = n-1;
        FORR(x, n-2, 0) drr[x][y] = grid[x+1][y] == 'X' ? x : drr[x+1][y];
    }

    // FR(i, n) dbgArr(lrr[i], m);
    // FR(i, n) dbgArr(rrr[i], m);
}

void bfs(int sx, int sy){
    // cerr << sx << ' ' << sy << endl;
    vis[sx][sy] = true;
    qu[qr++] = {sx, sy};
    while(ql < qr){
        auto [x1, y1] = qu[ql++];
        for(auto [dx, dy] : MOVES){
            int x2 = x1+dx, y2 = y1+dy;
            if(x2 < 0 || x2 >= n || y2 < 0 || y2 >= m || grid[x2][y2] == 'X' || vis[x2][y2]) continue;
            if(x1 != x2){
                int l1 = lrr[x1][y1], r1 = min(y1, rrr[x1][y1]-k2+1);
                int l2 = lrr[x2][y2], r2 = min(y1, rrr[x2][y2]-k2+1);
                if(r2 < l2 || r1 < l2 || r2 < l1) continue;
            }
            else {
                int u1 = urr[x1][y1], d1 = min(x1, drr[x1][y1]-k1+1);
                int u2 = urr[x2][y2], d2 = min(x2, drr[x2][y2]-k1+1);
                if(d2 < u2 || d1 < u2 || d2 < u1) continue;
            }
            vis[x2][y2] = true;
            qu[qr++] = {x2, y2};
        }
    }
}

int main(){
    cin.sync_with_stdio(0); cin.tie(0);
    cin >> m >> n >> k2 >> k1;
    int sx1, sy1, sx2, sy2;
    cin >> sy1 >> sx1 >> sy2 >> sx2;
    FR(i, n) cin >> grid[i];
    preProc();
    bfs(sx1, sy2);
    // FR(i, n) dbgArr(vis[i], m);
    FR(i, n) FR(j, m) if(grid[i][j] == '*') cout << (vis[i][j] ? "YES\n" : "NO\n");
}