#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
#ifdef Doludu
template <typename T>
ostream& operator << (ostream &o, vector <T> vec) {
    o << "{"; int f = 0;
    for (T i : vec) o << (f++ ? " " : "") << i;
    return o << "}";
}
void bug__(int c, auto ...a) {
    cerr << "\e[1;" << c << "m";
    (..., (cerr << a << " "));
    cerr << "\e[0m" << endl;
}
#define bug_(c, x...) bug__(c, __LINE__, "[" + string(#x) + "]", x)
#define bug(x...) bug_(32, x)
#define bugv(x...) bug_(36, vector(x))
#define safe bug_(33, "safe")
#else
#define bug(x...) void(0)
#define bugv(x...) void(0)
#define safe void(0)
#endif
const int mod = 998244353, N = 300005;

void solve() {
    int n, m, sx, sy;
    cin >> n >> m >> sx >> sy, --sx, --sy;
    vector <string> s(n);
    for (int i = 0; i < n; ++i) cin >> s[i];

    vector <vector <pii>> adj(n * m * 18);
    auto f = [&](int x, int y, int d) {
        if (x >= n || x < 0 || y >= m || y < 0 || s[x][y] == '#') return -1;
        return d * n * m + x * m + y;
    };
    auto add = [&](int u, int v, int w) {
        if (u == -1 || v == -1) return;
        adj[u * 2].emplace_back(v * 2 + w, w);
        adj[u * 2 + 1].emplace_back(v * 2 + (w ^ 1), w);
    };
    vector <int> dx = {0, 0, 1, -1, 1, -1, -1, 1}, dy = {1, -1, 0, 0, 1, -1, 1, -1};
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            for (int k = 0; k < 8; ++k) {
                add(f(i, j, 8), f(i + dx[k], j + dy[k], k), 1);
                add(f(i, j, k), f(i + dx[k], j + dy[k], k), 0);
                add(f(i, j, k), f(i, j, 8), 0);
            }
        }
    }

    int ss = f(sx, sy, 8) * 2;
    vector <int> dis(n * m * 18, 1 << 30);
    deque <int> dq;
    dq.push_back(ss);
    dis[ss] = 0;
    while (!dq.empty()) {
        int v = dq.front(); dq.pop_front();
        for (auto [u, w] : adj[v]) if (dis[u] > dis[v] + w) {
            dis[u] = dis[v] + w;
            if (w) dq.push_back(u);
            else dq.push_front(u);
        }
    }

    int q;
    cin >> q;
    while (q--) {
        int x, y, d;
        cin >> x >> y >> d, --x, --y;
        int t = f(x, y, 8) * 2 + (d & 1);
        if (ss == t) {
            if (!adj[ss].empty()) cout << "Yes\n";
            else cout << "No\n";
        } else if (dis[t] <= d) cout << "Yes\n";
        else cout << "No\n";
    }
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}