#include <bits/stdc++.h>
#define M 501
#define LOGM 14

using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

int LOG[M], n, m, x, y, l;
int rmq[M][M][LOGM];

void compute_log()
{
  LOG[1]=0;
  for(int i=2; i<=n; i++)
      LOG[i] = LOG[i/2] + 1;
}

void build_rmq()
{
  for(int k=1; k<=LOG[n]; k++)
    for(int i=1; i <= n-(1<<k)+1; i++)
      for(int j=1; j <= n-(1<<k)+1; j++)
      {
        int i2=i+(1<<(k-1));
        int j2=j+(1<<(k-1));
        rmq[i][j][k] = max( {rmq[i][j][k-1], rmq[i2][j][k-1],
          rmq[i][j2][k-1], rmq[i2][j2][k-1]} );
      }
}

int main()
{
  fin>>n>>m;
  compute_log();

  for(int i=1; i<=n; i++)
    for(int j=1; j<=n; j++)
      fin>>rmq[i][j][0];
  build_rmq();

  for(int i=1; i<=m; i++)
  {
    fin>>x>>y>>l;
    int len=LOG[l];
    int x1=x+l-(1<<len);
    int y1=y+l-(1<<len);
    int s=max( {rmq[x][y][len], rmq[x1][y][len],
      rmq[x][y1][len], rmq[x1][y1][len]} );
    fout<<s<<'\n';
  }

  return 0;
}