#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;

int main()
{
    int w, h, k, l;
    cin>>w>>h>>k>>l;
    int a, b, c, d;
    cin>>a>>b>>c>>d;
    pii end, start={c, b};
    vector<bool> A(h, 0);
    vector<vector<bool>> maze(w, A);
    for(int i=0; i<h; i++){
        for(int j=0; j<w; j++){
            char x;
            cin>> x;
            if(x=='*') end={j, i};
            if(x=='X') maze[j][i]=1;
        }
    }
    //find the highest point below every square and the symmetric things
    vector<pair<pii, pii>> B(h);
    vector<vector<pair<pii, pii>>> uptop(w, B);
    for(int i=0; i<h; i++){
        int dist=-1;
        for(int j=0; j<w; j++){
            dist++;
            if(maze[j][i]) dist=-1;
            uptop[j][i].first.first=dist;
        }
    }
    for(int i=0; i<h; i++){
        int dist=-1;
        for(int j=w-1; j>=0; j--){
            dist++;
            if(maze[j][i]) dist=-1;
            uptop[j][i].first.second=dist;
        }
    }
    for(int i=0; i<w; i++){
        int dist=-1;
        for(int j=0; j<h; j++){
            dist++;
            if(maze[i][j]) dist=-1;
            uptop[i][j].second.first=dist;
        }
    }
    for(int i=0; i<w; i++){
        int dist=-1;
        for(int j=h-1; j>=0; j--){
            dist++;
            if(maze[i][j]) dist=-1;
            uptop[i][j].second.second=dist;
        }
    }
    
    vector<vector<bool>> can_reach(w, A);
    can_reach[c][b]=1;
    queue<pair<int, pii>> search;
    if(c>0){
        search.push({1, {c-1, b}});
    }
    if(c<w-1){
        search.push({0,{c+1, b}});
    }
    if(b>0){
        search.push({2, {c, b-1}});
    }
    if(b<h-1){
        search.push({3, {c, b+1}});
    }
    while(!search.empty()){
        pair<int, pii> x = search.front();
        search.pop();
        if(maze[x.second.first][x.second.second]) continue;
        if(can_reach[x.second.first][x.second.second]) continue;
        if(x.first==0){
            if(min(uptop[x.second.first][x.second.second].second.first, uptop[x.second.first-1][x.second.second].second.first)+min(uptop[x.second.first][x.second.second].second.second, uptop[x.second.first-1][x.second.second].second.second)<l-1) continue;
        }
        if(x.first==1){
            if(min(uptop[x.second.first][x.second.second].second.first, uptop[x.second.first+1][x.second.second].second.first)+min(uptop[x.second.first][x.second.second].second.second, uptop[x.second.first+1][x.second.second].second.second)<l-1) continue;
        }
        if(x.first==3){
            if(min(uptop[x.second.first][x.second.second].first.first, uptop[x.second.first][x.second.second-1].first.first)+min(uptop[x.second.first][x.second.second].first.second, uptop[x.second.first][x.second.second-1].first.second)<k-1) continue;
        }
        if(x.first==2){
            if(min(uptop[x.second.first][x.second.second].first.first, uptop[x.second.first][x.second.second+1].first.first)+min(uptop[x.second.first][x.second.second].first.second, uptop[x.second.first][x.second.second+1].first.second)<k-1) continue;
        }
        b=x.second.second;
        c=x.second.first;
        can_reach[c][b]=1;
        if(c>0){
            search.push({1, {c-1, b}});
        }
        if(c<w-1){
            search.push({0,{c+1, b}});
        }
        if(b>0){
            search.push({2, {c, b-1}});
        }
        if(b<h-1){
            search.push({3, {c, b+1}});
        }
    }
    if(can_reach[end.first][end.second]) cout<<"YES";
    else cout<<"NO";
    
    
    
    

    return 0;
}