#include <bits/stdc++.h>

using namespace std;
#pragma GCC optimize("Ofast")

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 1500 + 10;
const int M = 1e5 + 10;
int mod = 998244353;
const int infi = INT_MAX;
const ll infl = 1e16;
const int P = 2;

int mult(int a, int b){
    return a * 1LL * b % mod;
}

int sum(int a, int b){
    if(a + b >= mod)
        return a + b - mod;
    if(a + b < 0)
        return a + b + mod;
    return a + b;
}

int binpow(int a, int n){
    if (n == 0)
        return 1;
    if (n % 2 == 1){
        return mult(binpow(a, n - 1), a);
    }
    else{
        auto b = binpow(a, n / 2);
        return mult(b, b);
    }
}

int n, m, w, h, tmp, a[N][N], pr[N][N], mxu[N][N], mxb[N][N], mxl[N][N], mxr[N][N], used[N][N];
pii st, en;

int gets(int u, int l, int b, int r){
    return pr[b][r] - pr[b][l - 1] - pr[u - 1][r] + pr[u - 1][l - 1];
}

void dfs(int i, int j){
    used[i][j] = 1;
    if(i - 1 > 0 && !used[i - 1][j]){
        int l = max(mxl[i][j], mxl[i - 1][j]), r = min(mxr[i][j], mxr[i - 1][j]);
        if(r - l + 1 >= w)
            dfs(i - 1, j);
    }

    if(i + 1 <= n && !used[i + 1][j]){
        int l = max(mxl[i][j], mxl[i + 1][j]), r = min(mxr[i][j], mxr[i + 1][j]);
        if(r - l + 1 >= w)
            dfs(i + 1, j);
    }
    if(j - 1 > 0 && !used[i][j - 1]){
        int u = max(mxu[i][j], mxu[i][j - 1]), b = min(mxb[i][j], mxb[i][j - 1]);
        if(b - u + 1 >= h)
            dfs(i, j - 1);
    }

    if(j + 1 <= m && !used[i][j + 1]){
        int u = max(mxu[i][j], mxu[i][j + 1]), b = min(mxb[i][j], mxb[i][j + 1]);
        if(b - u + 1 >= h)
            dfs(i, j + 1);
    }
}

void solve(){
    cin >> m >> n >> w >> h;
    cin >> tmp >> st.F >> st.S >> tmp;
    st.F++;
    st.S++;
    for(int i = 1; i <= n; i++){
        string s;
        cin >> s;
        for(int j = 0; j < m; j++){
            if(s[j] == 'X')
                a[i][j + 1] = 1;
            if(s[j] == '*'){
                en = {i, j + 1};
            }
        }
        for(int j = 1; j <= m; j++){
            used[i][j] = a[i][j];
            pr[i][j] = pr[i - 1][j] + pr[i][j - 1] - pr[i - 1][j - 1] + a[i][j];
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(used[i][j])
                continue;
            int lo = max(0LL, j - w), hi = j;
            while(lo + 1 < hi){
                int m = (lo + hi) / 2;
                if(gets(i, m, i, j))
                    lo = m;
                else
                    hi = m;
            }
            mxl[i][j] = hi;

            lo = j, hi = min(m + 1, j + w);
            while(lo + 1 < hi){
                int m = (lo + hi) / 2;
                if(gets(i, j, i, m))
                    hi = m;
                else
                    lo = m;
            }
            mxr[i][j] = lo;

            lo = max(0LL, i - h), hi = i;
            while(lo + 1 < hi){
                int m = (lo + hi) / 2;
                if(gets(m, j, i, j))
                    lo = m;
                else
                    hi = m;
            }
            mxu[i][j] = hi;

            lo = i, hi = min(n + 1, i + h);
            while(lo + 1 < hi){
                int m = (lo + hi) / 2;
                if(gets(i, j, m, j))
                    hi = m;
                else
                    lo = m;
            }
            mxb[i][j] = lo;
        }
    }
    dfs(st.F, st.S);
    cout << (used[en.F][en.S] ? "YES\n" : "NO\n");
}

signed main(){
    mispertion;
    int t = 1;
    //cin >> t;
    while (t--){
        solve();
    }
    return 0;
}