#include <bits/stdc++.h>

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, m;
    std::cin >> n >> m;
    std::swap(n, m);
    int K, L;
    std::cin >> K >> L;
    std::swap(K, L);
    std::pair<int, int> ph, pv;
    std::cin >> ph.first >> ph.second >> pv.first >> pv.second;
    std::swap(ph.first, ph.second);
    std::swap(pv.first, pv.second);
    std::vector<std::string> input(n);
    for (auto& s : input) {
        std::cin >> s;
    }

    std::pair<int, int> tg;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (input[i][j] == '*') {
                tg = {i, j};
            }
        }
    }
    std::vector<std::vector<int>> prf(n + 1, std::vector<int>(m + 1));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            prf[i + 1][j + 1] = (input[i][j] == 'X') + prf[i][j + 1] + prf[i + 1][j] - prf[i][j];
        }
    }

    auto get_sum = [&](char tp, std::pair<int, int> p) {
        std::pair<int, int> p2(p.first + (tp == 'h' ? 1 : K), p.second + (tp == 'h' ? L : 1));
        if (p.first < 0 || p.second < 0 || n < p2.first || m < p2.second) {
            return 1;
        }
        int res = prf[p2.first][p2.second] - prf[p.first][p2.second] - prf[p2.first][p.second] + prf[p.first][p.second];
        return res;
    };
    auto check_tg = [&](char tp, std::pair<int, int> p) {
        std::pair<int, int> p2(p.first + (tp == 'h' ? 1 : K), p.second + (tp == 'h' ? L : 1));
        if (p.first < 0 || p.second < 0 || n < p2.first || m < p2.second) {
            return false;
        }
        return p.first <= tg.first && tg.first < p2.first && p.second <= tg.second && tg.second < p2.second;
    };

    std::vector<int> rv(n * m), rh(n * m);
    for (char ch : std::string{"vh"}) {
        auto& vec = ch == 'h' ? rh : rv;
        std::vector<int> stack;
        stack.push_back((ch == 'h') ? ph.first * m + ph.second : pv.first * m + pv.second);
        while (stack.size()) {
            int v = stack.back();
            stack.pop_back();
            if (!vec[v]) {
                vec[v] = 1;
                auto [x, y] = div(v, m);
                assert(get_sum(ch, {x, y}) == 0);
                for (auto [dx, dy] : std::array<std::pair<int, int>, 4>{{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}}) {
                    int x2 = x + dx, y2 = y + dy;
                    if (get_sum(ch, {x2, y2}) == 0) {
                        stack.push_back(x2 * m + y2);
                    }
                }
            }
        }
    }

    // for (auto vec : std::vector{rv, rh}) {
    //     for (int i = 0; i < n; i++) {
    //         for (int j = 0; j < m; j++) {
    //             if (vec[i * m + j]) {
    //                 std::cerr << "+";
    //             } else {
    //                 std::cerr << input[i][j];
    //             }
    //         }
    //         std::cerr << std::endl;
    //     }
    //     std::cerr << std::endl;
    // }

    bool suc1 = false, suc2 = false;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            suc1 |= rv[i * m + j] && check_tg('v', {i, j});
            suc2 |= rh[i * m + j] && check_tg('h', {i, j});
        }
    }

    if (suc1 && suc2) {
        std::cout << "YES\n";
    } else {
        std::cout << "NO\n";
    }

    return 0;
}