#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char s) { return string(1, s); }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A>
string to_string(A);
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool f = 1;
  string r = "{";
  for (const auto& x : v) {
    if (!f) r += ", ";
    f = 0;
    r += to_string(x);
  }
  return r + "}";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int inf = 1e9;
const long long INF = 1e18;
const int mod = 1e9 + 7;
const int bit32 = log2(inf) + 3;
const int bit64 = log2(INF) + 3;
inline int add(long long a, long long b) {
  a += b;
  if (a >= mod) a -= mod;
  return a;
}
inline int sub(long long a, long long b) {
  a -= b;
  if (a < 0) a += mod;
  return a;
}
inline int mul(long long a, long long b) {
  a %= mod;
  b %= mod;
  return (int)((long long)a * b % mod);
}
inline int modexpo(long long a, long long b) {
  int res = 1;
  while (b > 0) {
    if (b & 1) res = mul(res, a);
    a = mul(a, a);
    b /= 2;
  }
  return res;
}
inline int divide(long long a, long long b) {
  return mul(a, modexpo(b, mod - 2));
}
inline int inv(long long a) { return modexpo(a, mod - 2); }
clock_t time_p = clock();
void ktj() {
  time_p = clock() - time_p;
  cerr << "Time elapsed : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
void pre() {}
vector<string> grid;
vector<vector<int>> min_dist;
int n, m, t;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
using T = pair<int, pair<int, int>>;
queue<T> q;
void bfs() {
  int i, j, k;
  while (!q.empty()) {
    T top = q.front();
    int x_ = top.second.first, y_ = top.second.second;
    int color = grid[x_][y_] - '0';
    q.pop();
    for (i = 0; i < 4; i++) {
      int x = x_ + dx[i], y = y_ + dy[i];
      if (x >= 1 and x <= n and y >= 1 and y <= m) {
        int new_color = grid[x][y] - '0';
        if (color == new_color) {
          if (min_dist[x][y] > min_dist[x_][y_]) {
            min_dist[x][y] = min_dist[x_][y_];
            q.push(make_pair(min_dist[x][y], make_pair(x, y)));
          }
        } else {
          if (min_dist[x][y] > 1 + min_dist[x_][y_]) {
            min_dist[x][y] = 1 + min_dist[x_][y_];
            q.push(make_pair(min_dist[x][y], make_pair(x, y)));
          }
        }
      }
    }
  }
}
void solve() {
  cin >> n >> m >> t;
  int i, j, k;
  grid.resize(n + 1);
  min_dist.assign(n + 1, vector<int>(m + 1, inf));
  int white = 0, black = 0;
  for (i = 1; i <= n; i++) {
    cin >> grid[i];
    grid[i] = "$" + grid[i];
    for (j = 1; j <= m; j++) {
      int col = grid[i][j] - '0';
      white += 1 - col;
      black += col;
    }
  }
  if (white && black) {
    for (i = 1; i <= n; i++) {
      for (j = 1; j <= m; j++) {
        for (k = 0; k < 4; k++) {
          int x = i + dx[k], y = j + dy[k];
          if (x >= 1 and x <= n and y >= 1 and y <= m) {
            if (grid[x][y] == grid[i][j]) {
              min_dist[i][j] = 1;
              q.push(make_pair(1, make_pair(i, j)));
              break;
            }
          }
        }
      }
    }
    bfs();
  }
  for (i = 1; i <= t; i++) {
    int x, y;
    long long p;
    cin >> x >> y >> p;
    int col = grid[x][y] - '0';
    if (white && black) {
      if (min_dist[x][y] != inf) {
        if (p < min_dist[x][y]) {
          cout << col << '\n';
        } else {
          p -= min_dist[x][y];
          p = 1 - (p & 1);
          cout << (col ^ p) << '\n';
        }
      } else {
        cout << col << '\n';
      }
    } else {
      cout << col << '\n';
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  pre();
  int t = 1, T;
  if (0) cin >> t;
  for (T = 1; T <= t; T++) {
    if (0) cout << "Case #" << T << ": ";
    solve();
  }
  ktj();
}
