#include <bits/stdc++.h>
using namespace std;
void rset();
void init_test();
void solve();
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed;
  cout.precision(20);
  init_test();
  return 0;
}
template <typename T>
void chmin(T& a, T b) {
  if (a > b) a = b;
}
template <typename T>
void chmax(T& a, T b) {
  if (a < b) a = b;
}
template <typename T>
void MACRO_rdv2_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_rdv2_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_rdv2_Init(n, rest...);
}
template <typename T>
void MACRO_rdv2_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_rdv2_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_rdv2_Scan(p, rest...);
}
template <typename T>
void wrv(const vector<T>& v) {
  for (int(__ii) = (0); (__ii) < (((int)v.size())); ++(__ii)) {
    if (__ii) cout << ' ';
    cout << v[__ii];
  }
  cout << '\n';
}
template <typename T>
void wrm(const vector<vector<T>>& v) {
  for (int(__ii) = (0); (__ii) < (((int)v.size())); ++(__ii)) {
    for (int(__jj) = (0); (__jj) < (v[__ii].size()); ++(__jj)) {
      if (__jj) cout << ' ';
      cout << v[__ii][__jj];
    }
    cout << '\n';
  }
}
template <typename T>
void sc(T& x) {
  cin >> x;
}
template <typename Head, typename... Tail>
void sc(Head& head, Tail&... tail) {
  cin >> head;
  sc(tail...);
}
template <typename T>
void wr(const T& x) {
  cout << x << '\n';
}
template <typename Head, typename... Tail>
void wr(const Head& head, const Tail&... tail) {
  cout << head << ' ';
  wr(tail...);
}
template <typename T>
void wrf(const T& x) {
  cout << x << endl;
}
template <typename Head, typename... Tail>
void wrf(const Head& head, const Tail&... tail) {
  cout << head << ' ';
  wrf(tail...);
}
template <typename T>
void debug_out(const T& x) {
  cerr << x << '\n';
}
template <typename Head, typename... Tail>
void debug_out(const Head& head, const Tail&... tail) {
  cerr << head << ' ';
  debug_out(tail...);
}
template <typename... T>
void err(const T&... cod) {
  wr(cod...);
  exit(0);
}
const int N = 1010;
int n, m, qq;
string a[N];
int start[N][N];
bool valid(int y, int x, int n, int m) {
  if (y < 0 || x < 0 || y >= n || x >= m) return false;
  return true;
}
void solve() {
  cin >> n >> m >> qq;
  for (int(i) = (0); (i) < (n); ++(i)) cin >> a[i];
  const int dy[] = {-1, 0, 1, 0};
  const int dx[] = {0, 1, 0, -1};
  memset(start, -1, sizeof start);
  queue<int> qy, qx;
  for (int(i) = (0); (i) < (n); ++(i))
    for (int(j) = (0); (j) < (m); ++(j)) {
      for (int(d) = (0); (d) < (4); ++(d)) {
        int ny = i + dy[d];
        int nx = j + dx[d];
        if (valid(ny, nx, n, m) && a[i][j] == a[ny][nx]) {
          qy.push(ny);
          qx.push(nx);
          start[ny][nx] = 0;
        }
      }
    }
  while (!qx.empty()) {
    int y = qy.front();
    int x = qx.front();
    qy.pop();
    qx.pop();
    for (int(d) = (0); (d) < (4); ++(d)) {
      int ny = y + dy[d];
      int nx = x + dx[d];
      if (valid(ny, nx, n, m) && a[y][x] != a[ny][nx] && start[ny][nx] == -1) {
        qy.push(ny);
        qx.push(nx);
        start[ny][nx] = start[y][x] + 1;
      }
    }
  }
  while (qq--) {
    int y, x;
    sc(y, x);
    long long p;
    sc(p);
    --y, --x;
    if (start[y][x] == -1 || start[y][x] > p)
      wr(a[y][x]);
    else
      wr((int(a[y][x] - '0') + p + start[y][x]) % 2);
  }
}
void init_test() {
  int qq = 1;
  while (qq--) solve();
}
