#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 500;
const int LOGMAX = 8;
int rmq[NMAX + 5][NMAX + 5][LOGMAX + 5], lg[NMAX + 5], p2[LOGMAX + 5];
int maxim(int a, int b, int c, int d){
  return max(a, max(b, max(c, d)));
}
int main(){
  freopen("plantatie.in", "r", stdin);
  freopen("plantatie.out", "w", stdout);
  int n, m, i, j, k, x, y, p;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i ++)
    for (j = 1; j <= n; j ++)
      scanf("%d", &rmq[i][j][0]);
  for (i = 2; i <= n; i ++)
    lg[i] = lg[i / 2] + 1;
  p2[0] = 1;
  for (i = 1; i <= lg[n]; i ++)
    p2[i] = (p2[i - 1] << 1);
  for (k = 1; k <= lg[n]; k ++)
    for (i = 1; i + p2[k - 1] <= n; i ++)
      for (j = 1; j + p2[k - 1] <= n; j ++)
        rmq[i][j][k] = maxim(rmq[i + p2[k - 1]][j][k - 1], rmq[i][j + p2[k - 1]][k - 1],
                            rmq[i][j][k - 1], rmq[i + p2[k - 1]][j + p2[k - 1]][k - 1]);
  for (i = 1; i <= m; i ++){
    scanf("%d%d%d", &x, &y, &k);
    p = lg[k];
    printf("%d\n", maxim(rmq[x + k - p2[p]][y][p], rmq[x][y + k - p2[p]][p],
                     rmq[x][y][p], rmq[x + k - p2[p]][y + k - p2[p]][p]));
  }
  return 0;
}