#include <bits/stdc++.h>

using namespace std;

int int_len(pair<int, int> s1, pair<int, int> s2) {
    return max(0, min(s1.second, s2.second) - max(s1.first, s2.first) + 1);
}

void solve() {
    int n, m, w, h; cin >> n >> m >> w >> h;
    swap(n, m);
    int i1, j1, i2, j2; cin >> i1 >> j1 >> i2 >> j2;
    swap(i1, j1); swap(i2, j2);
    int curi = i1, curj = j2;
    vector<vector<int>> a(n, vector<int>(m));
    int ig, jg;
    for (int i = 0; i < n; i++) {
        string s; cin >> s;
        for (int j = 0; j < m; j++) {
            if (s[j] == '*') {
                ig = i;
                jg = j;
            } else if (s[j] == 'X') a[i][j] = 1;
        }
    }
    vector<vector<pair<int, int>>> seg_vert(n, vector<pair<int, int>>(m, {n, -1})), seg_hor(n, vector<pair<int, int>>(m, {m, -1}));
    vector<vector<vector<pair<int, int>>>> g(n, vector<vector<pair<int, int>>>(m));
    for (int i = 0; i < n; i++) {
        int curl = -1;
        for (int j = 0; j < m; j++) {
            if (a[i][j] == 0 && curl == -1) {
                curl = j;
            }
            if (a[i][j] == 1) curl = -1;
            if (a[i][j] == 0) seg_hor[i][j].first = curl;
        }
        int curr = -1;
        for (int j = m - 1; j >= 0; j--) {
            if (a[i][j] == 0 && curr == -1) curr = j;
            if (a[i][j] == 1) curr = -1;
            if (a[i][j] == 0) seg_hor[i][j].second = curr;
        }
    }
    for (int j = 0; j < m; j++) {
        int curl = -1;
        for (int i = 0; i < n; i++) {
            if (a[i][j] == 0 && curl == -1) {
                curl = i;
            }
            if (a[i][j] == 1) curl = -1;
            if (a[i][j] == 0) seg_vert[i][j].first = curl;
        }
        int curr = -1;
        for (int i = n - 1; i >= 0; i--) {
            if (a[i][j] == 0 && curr == -1) curr = i;
            if (a[i][j] == 1) curr = -1;
            if (a[i][j] == 0) seg_vert[i][j].second = curr;
        }
    }
    auto check = [&](int i, int j, int i1, int j1) {
        if (a[i][j] == 1) return false;
        if (i1 < 0 || i1 >= n || j1 < 0 || j1 >= m || a[i1][j1] == 1) return false;
        if (seg_vert[i][j].second - seg_vert[i][j].first + 1 < h || seg_hor[i][j].second - seg_hor[i][j].first + 1 < w || 
            seg_vert[i1][j1].second - seg_vert[i1][j1].first + 1 < h || seg_hor[i1][j1].second - seg_hor[i1][j1].first + 1 < w) return false;
        if (i == i1) {
            return int_len(seg_vert[i][j], seg_vert[i1][j1]) >= h;
        }
        return int_len(seg_hor[i][j], seg_hor[i1][j1]) >= w;
    };
    vector<pair<int, int>> dir = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (auto &u : dir) {
                if (check(i, j, i + u.first, j + u.second)) {
                    g[i][j].push_back({i + u.first, j + u.second});
                }
            }
        }
    }
    vector<vector<int>> used(n, vector<int>(m, 0));
    auto dfs = [&](int i, int j, auto&&dfs) -> void {
        used[i][j] = 1;
        for (auto &u : g[i][j]) {
            if (!used[u.first][u.second]) dfs(u.first, u.second, dfs);
        }
    };
    dfs(curi, curj, dfs);
    cout << (used[ig][jg] ? "YES\n" : "NO\n");
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else 
        ios::sync_with_stdio(false); cin.tie(0); 
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}