//
//  main.cpp
//  cses
//
//  Created by REALafek on 20/05/2024.
//

#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <queue>
using namespace std;
using ll = long long;
vector<vector<bool>> kdp;
vector<vector<bool>> ldp;
vector<vector<bool>> grid;
vector<vector<bool>> been;
void dfs(int x, int y){
    been[x][y]=true;
    if (x!=grid.size()-1) {
        if (!been[x+1][y]) {
            if (grid[x+1][y] && ldp[x][y]) {
                dfs(x+1, y);
            }
        }
    }
    if (y!=grid[0].size()-1) {
        if (!been[x][y+1]) {
            if (grid[x][y+1] && kdp[x][y]) {
                dfs(x, y+1);
            }
        }
    }
    if (x!=0) {
        if (!been[x-1][y]) {
            if (grid[x-1][y] && ldp[x-1][y]) {
                dfs(x-1, y);
            }
        }
    }
    if (y!=0) {
        if (!been[x][y-1]) {
            if (grid[x][y-1] && kdp[x][y-1]) {
                dfs(x, y-1);
            }
        }
    }
}
int main(int argc, const char * argv[]) {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int w,h,k,l;cin>>w>>h>>k>>l;
    int xk,yk,xl,yl;cin>>xk>>yk>>xl>>yl;
    int x=xl;
    int y=yk;
    vector<bool> v(h, false);
    kdp.resize(w,v);
    ldp.resize(w,v);
    grid=ldp;
    been=grid;
    int xdest=0,ydest=0;
    for (int i=0; i<h; i++) {
        for (int j=0; j<w; j++) {
            char a;cin>>a;
            if (a!='X') {
                grid[j][i]=true;
                if (a=='*') {
                    xdest=j;
                    ydest=i;
                }
            }
        }
    }
    int cur_length=0;
    int last_end=-100000;
    for (int i=0; i<h-1; i++) {
        cur_length=0;
        last_end=-100000;
        for (int j=0; j<k-1; j++) {
            if (grid[j][i] && grid[j][i+1]) {
                cur_length++;
            }
            else{
                cur_length=0;
            }
        }
        for (int j=0; j<w; j++) {
            if (j+k<=w) {
                if (grid[j+k-1][i] && grid[j+k-1][i+1]) {
                    cur_length++;
                    if (cur_length>=k) {
                        last_end=j;
                    }
                }
                else{
                    cur_length=0;
                }
            }
            kdp[j][i]=((last_end+k)>j);
        }
    }
    for (int j=0; j<w-1; j++) {
        cur_length=0;
        last_end=-100000;
        for (int i=0; i<l-1; i++) {
            if (grid[j][i] && grid[j+1][i]) {
                cur_length++;
            }
            else{
                cur_length=0;
            }
        }
        for (int i=0; i<h; i++) {
            if (i+l<=h) {
                if (grid[j][i+l-1] && grid[j+1][i+l-1]) {
                    cur_length++;
                    if (cur_length>=l) {
                        last_end=i;
                    }
                }
                else{
                    cur_length=0;
                }
            }
            ldp[j][i]=((last_end+l)>i);
        }
    }
    dfs(x, y);
    if (been[xdest][ydest]) {
        cout<<"YES";
    }
    else{
        cout<<"NO";
    }
}