#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w, sx, sy;
  cin >> h >> w >> sx >> sy;
  sx--, sy--;
  vector<string> s(h);
  rep(i, h) cin >> s[i];
  constexpr int INF = 1001001001;
  vector dist(h, vector(w, array<int, 2>{INF, INF}));
  queue<tuple<int, int, int>> q;
  dist[sx][sy][0] = 0;
  q.emplace(sx, sy, 0);
  auto idxchk = [&](int i, int j) { return 0 <= i && i < h && 0 <= j && j < w && s[i][j] == '.'; };
  while (q.size()) {
    auto [i, j, p] = q.front(); q.pop();
    rep(k, 8) {
      int x = i+dx[k], y = j+dy[k];
      while (idxchk(x, y)) {
        if (dist[x][y][p^1] == INF) {
          dist[x][y][p^1] = dist[i][j][p] + 1;
          q.emplace(x, y, p^1);
        }
        if (dist[x][y][p] <= dist[i][j][p]) break;
        x += dx[k];
        y += dy[k];
      }
    }
  }
  int Q;
  cin >> Q;
  while (Q--) {
    int gx, gy, t;
    cin >> gx >> gy >> t;
    gx--, gy--;
    int d = dist[gx][gy][t&1];
    cout << (d <= t ? "Yes\n" : "No\n");
  }
}