#include <bits/stdc++.h>
using namespace std;

int w, h, k, l;
int xh, yh, xv, yv;
string s[1510];

int sx, sy, tx, ty;
int U[1510][1510], D[1510][1510], L[1510][1510], R[1510][1510];
bool vis[1510][1510];

struct Node {
    int x, y;
};

queue<Node> Q;

inline bool intersect(int y1, int x1, int y2, int x2) {
    return
    min(D[x1][y1], D[x2][y2]) - max(U[x1][y1], U[x2][y2]) + 1 >= l &&
    min(R[x1][y1], R[x2][y2]) - max(L[x1][y1], L[x2][y2]) + 1 >= k;
}

inline bool check(int x, int y, int dx, int dy) {
    if (x + dx <= 0 || x + dx > w || y + dy <= 0 || y + dy > h) return false;
    if (s[y + dy][x + dx] != '.') return false;
    return intersect(x, y, x + dx, y + dy);
}

int main() {
    cin.tie(0), cout.tie(0);
    ios_base::sync_with_stdio(false);
    
    cin >> w >> h >> k >> l;
    cin >> xh >> yh >> xv >> yv;
    xh++, yh++, xv++, yv++;
    
    for (int i = 1; i <= h; i++) {
        cin >> s[i];
        s[i] = ' ' + s[i] + ' ';
    }
    for (int i = 0; i <= w + 1; i++)
        s[0] += ' ', s[h + 1] += ' ';
    
    sx = xv, sy = yh;
    for (int i = 1; i <= h; i++) {
        for (int j = 1; j <= w; j++) {
            if (s[i][j] == '*') {
                tx = j, ty = i;
                s[i][j] = '.';
            }
        }
    }
    
    for (int i = 1; i <= h; i++) {
        for (int j = 1; j <= w; j++) {
            if (s[i][j] != '.') continue;
            if (s[i - 1][j] == '.') U[i][j] = U[i - 1][j];
            else U[i][j] = i;
            if (s[i][j - 1] == '.') L[i][j] = L[i][j - 1];
            else L[i][j] = j;
            U[i][j] = max(i - l + 1, U[i][j]);
            L[i][j] = max(j - k + 1, L[i][j]);
        }
    }
    
    for (int i = h; i >= 1; i--) {
        for (int j = w; j >= 1; j--) {
            if (s[i][j] != '.') continue;
            if (s[i + 1][j] == '.') D[i][j] = D[i + 1][j];
            else D[i][j] = i;
            if (s[i][j + 1] == '.') R[i][j] = R[i][j + 1];
            else R[i][j] = j;
            D[i][j] = min(i + l - 1, D[i][j]);
            R[i][j] = min(j + k - 1, R[i][j]);
        }
    }
    
    Q.push(Node{sx, sy}); vis[sy][sx] = 1;
    while (!Q.empty()) {
        auto [x, y] = Q.front();
        Q.pop();
        for (int dx : {-1, 0, 1}) {
            for (int dy : {-1, 0, 1}) {
                if (dx != 0 && dy != 0) continue;
                if (vis[y + dy][x + dx]) continue;
                if (check(x, y, dx, dy)) {
                    vis[y + dy][x + dx] = 1;
                    Q.push(Node{x + dx, y + dy});
                }
            }
        }
    }
    
    if (vis[ty][tx]) {
        cout << "YES\n";
    } else {
        cout << "NO\n";
    }
    
    return 0;
}