#include <bits/stdc++.h>
#define logn 10
using namespace std;

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

int LOG[502], n, m, x, y, l;
int rmq[502][502][logn];

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 m1= max(rmq[i][j][k-1], rmq[i+(1<<(k-1))][j][k-1]);
        int m2= max(rmq[i][j+(1<<(k-1))][k-1], rmq[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
        rmq[i][j][k] = max(m1,m2);
      }
}

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 m1=max( rmq[x][y][LOG[l]], rmq[x][y + l - (1<<LOG[l]) ][LOG[l]] );
    int m2=max( rmq[x + l - (1<<LOG[l])][y][LOG[l]], rmq[x + l - (1<<LOG[l]) ][y + l - (1<<LOG[l]) ][LOG[l]] );
    int s=max(m1, m2);
    fout<<s<<'\n';
  }

  return 0;
}