#include <bits/stdc++.h>

// #define int long long
#define y1 yy

using namespace std;

// const int inf=1e18;
const int MAX=1500+10;

const int mod=1e9+7;

int h,w,k,l;
int a[MAX][MAX];
int dp[MAX][MAX];
int up[MAX][MAX],down[MAX][MAX];
int lef[MAX][MAX],rig[MAX][MAX];

void solve(){
    cin>>h>>w>>k>>l;
    swap(h,w);
    int x0,y0,x1,y1;
    cin>>x0>>y0>>x1>>y1;
    dp[y0][x1]=1;
    for(int i=1;i<=h;i++){
        for(int j=1;j<=w;j++){
            char x;
            cin>>x;
            if(x=='*')a[i][j]=-1;
            else if(x=='.')a[i][j]=0;
            else a[i][j]=1;
            // cout<<a[i][j]<<" ";
        }
        // cout<<"\n";
    }
    for(int i=1;i<=h;i++){
        for(int j=1;j<=w;j++){
            if(a[i][j]==1)up[i][j]=i;
            else up[i][j]=up[i-1][j];
        }
    }
    for(int j=1;j<=w;j++)down[h+1][j]=h+1;
    for(int i=h;i>=1;i--){
        for(int j=1;j<=w;j++){
            if(a[i][j]==1)down[i][j]=i;
            else down[i][j]=down[i+1][j];
        }
    }
    for(int i=1;i<=h;i++){
        for(int j=1;j<=w;j++){
            if(a[i][j]==1)lef[i][j]=j;
            else lef[i][j]=lef[i][j-1];
        }
    }
    for(int i=1;i<=h;i++)rig[i][w+1]=w+1;
    for(int i=1;i<=h;i++){
        for(int j=w;j>=1;j--){
            if(a[i][j]==1)rig[i][j]=j;
            else rig[i][j]=rig[i][j+1];
        }
    }
    queue<pair<int,int>> q;
    q.push({y0+1,x1+1});
    while(!q.empty()){
        int x=q.front().first,y=q.front().second;
        if(a[x][y]==-1){
            cout<<"YES\n";
            return;
        }
        // cout<<x<<" "<<y<<"\n";
        q.pop();
        if(y+1<=w){
            int U=max(up[x][y],up[x][y+1]),D=min(down[x][y],down[x][y+1]);
            // cout<<D<<" "<<U<<" "<<"\n";
            if(D-U-1>=l&&a[x][y+1]!=1){
                if(dp[x][y+1]==0){
                    dp[x][y+1]=1;
                    q.push({x,y+1});
                }
            }
        }
        if(y-1>=1){
            int U=max(up[x][y],up[x][y-1]),D=min(down[x][y],down[x][y-1]);
            if(D-U-1>=l&&a[x][y-1]!=1){
                if(dp[x][y-1]==0){
                    dp[x][y-1]=1;
                    q.push({x,y-1});
                }
            }
        }
        if(x+1<=h){
            int L=max(lef[x][y],lef[x+1][y]),R=min(rig[x][y],rig[x+1][y]);
            if(R-L-1>=k&&a[x+1][y]!=1){
                if(dp[x+1][y]==0){
                    dp[x+1][y]=1;
                    q.push({x+1,y});
                }
            }
        }
        if(x-1>=1){
            int L=max(lef[x][y],lef[x-1][y]),R=min(rig[x][y],rig[x-1][y]);
            if(R-L-1>=k&&a[x-1][y]!=1){
                if(dp[x-1][y]==0){
                    dp[x-1][y]=1;
                    q.push({x-1,y});
                }
            }
        }
    }
    cout<<"NO\n";
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
}