#include <stdio.h>
#include <math.h>
#include <iostream>
#include <fstream>
using namespace std;
FILE*f=fopen("plantatie.in","r");
ofstream g("plantatie.out");
int lg[501],x,y,z,sol,t,k,i,j,n,m,a,d,b,c,j2,rmq[501][501][10];
int main()
{
 fscanf(f,"%d%d",&n,&m);
 for(i=1;i<=n;i++)
 for(j=1;j<=n;j++)
    fscanf(f,"%d",&rmq[i][j][0]);
lg[1]=0;
for (int i =2; i<=n ;++i)
           lg[i]=lg[i/2]+1;


       for ( int k =1 ; k <= lg[n]; ++k)
    for(i=1;i<=n-(1<<(k-1));i++)
       for(j=1;j<=n-(1<<(k-1));j++)
    {

    rmq[i][j][k]=max(max(rmq[i][j+(1<<(k-1))][k-1],rmq[i][j][k-1]),max(rmq[i+(1<<(k-1))][j][k-1],rmq[i+(1<<(k-1))][j+(1<<(k-1))][k-1]));



    }

 for(t=1;t<=m;t++){
    fscanf(f,"%d%d%d",&x,&y,&z);

   int l=lg[z];

sol=max(max(rmq[x][y][l],rmq[x][y+z-(1<<l)][l]),max(rmq[x+z-(1<<l)][y][l],rmq[x+z-(1<<l)][y+z-(1<<l)][l]));
    g<<sol<<'\n';
 }

    return 0;
}