#include <bits/stdc++.h>

using namespace std;
    
typedef long long ll;
const int  N = 2e3 + 12, MOD = (int)1e9 + 7;
const int dx[] = {1,0,-1,0},dy[] = {0,1,0,-1};
int n, m, k, l, x, y;
int a[N][N],ph[N][N],nh[N][N],pv[N][N],nv[N][N];
bool vis[N][N];
bool ok(int X,int Y) {
    return (min(X,Y) >= 1 && X <= n && Y <= m && !a[X][Y]);
}
int inter(int l,int r,int l1,int r1) {
    // cout << l << ' ' << r << ' ' << l1 << ' ' << r1 << '\n';
    return max(0,min(r,r1) - max(l,l1) + 1);
}
void test(){
    cin >> n >> m >> k >> l;
    swap(n,m);
    int x1, y1;
    cin >> y >> x >> y1 >> x1;
    y = y1;
    x++;
    y++;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            char t;
            cin >> t;
            if(t == 'X') {
                a[i][j] = 1;
            }
            if(t == '*') {
                x1 = i;
                y1 = j;
            }
            if(a[i][j]) {
                ph[i][j] = j;
            } else {
                ph[i][j] = ph[i][j - 1];
            }
        }
        nh[i][m + 1] = m + 1;
        for(int j = m;j >= 1;j--) {
            if(a[i][j]) {
                nh[i][j] = j;
            } else {
                nh[i][j] = nh[i][j + 1];
            }
        }
    }
    for(int i = 1;i <= m;i++) {
        for(int j = 1; j <= n; j++) {
            if(a[j][i]) {
                pv[j][i] = j;
            } else {
                pv[j][i] = pv[j - 1][i];
            }
            // cout << j << ' ' << i << ' ' << pv[j][i] << '\n';   
        }
        nv[n + 1][i] = n + 1;
        for(int j = n; j >= 1; j--) {
            if(a[j][i]) {
                nv[j][i] = j;
            } else {
                nv[j][i] = nv[j + 1][i];
            }
        }
    }
    queue<pair<int,int>> q;
    q.push({x,y});
    vis[x][y] = 1;
    while(!q.empty()) {
        auto [x_,y_] = q.front();
        if(x_ == x1 && y_ == y1) {
            cout << "Yes\n";
            return;
        }
        q.pop();
        for(int i = 0; i < 4; i++) {
            int _x = x_ + dx[i],_y = y_ + dy[i];
            if(!ok(_x,_y) || vis[_x][_y]) continue;
            // cout << _x << ' ' << _y << '\n';
            if(x_ != _x) {
                if(inter(ph[x_][y_] + 1,nh[x_][y_] - 1,ph[_x][_y] + 1,nh[_x][_y] - 1) >= k) {
                    vis[_x][_y] = 1;
                    q.push({_x,_y});
                }
            } else {
                // cout << inter(pv[x_][y_] + 1,nv[x_][y_] - 1,pv[_x][_y] + 1,nv[_x][_y] - 1) << ' ' << "x\n";
                if(inter(pv[x_][y_] + 1,nv[x_][y_] - 1,pv[_x][_y] + 1,nv[_x][_y] - 1) >= l) {
                    vis[_x][_y] = 1;
                    q.push({_x,_y});
                }
            }
        }
    }
    cout << "No\n";
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) {
        test();
    }
}