#include<cstdio>
#include<algorithm>
using namespace std;
FILE*in=fopen("plantatie.in","r");
FILE*out=fopen("plantatie.out","w");
const int NMAX=1007;
const int LOGMAX=10;
int mat[NMAX][NMAX];
int rmq[NMAX][NMAX][LOGMAX+2];//maximul din patratul care incepe pe (i,j) si are latura egala cu 2^k
int po[]={1,2,4,8,16,32,64,128,256,512,1024};
int n,m,i,j,k,logg=0,lg,ras,klg,aux=1;
int main()
{
    fscanf(in,"%d%d",&n,&m);
    while(aux<=n)
    {
        aux*=2;
        logg++;
    }
    logg--;
    aux/=2;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            fscanf(in,"%d",&rmq[i][j][0]);
        }
    }
    for(k=1;k<=logg;k++)
    {
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                rmq[i][j][k]=max(
                max(rmq[i][j][k-1],
                rmq[i][j+po[k-1]][k-1]),
                max(rmq[i+po[k-1]][j][k-1],
                rmq[i+po[k-1]][j+po[k-1]][k-1]));
            }
        }
    }
    for(int it=1;it<=m;it++)
    {
        fscanf(in,"%d%d%d",&i,&j,&k);
        lg=0;
        aux=1;
        while(aux<=k)
        {
            lg++;
            aux*=2;
        }
        aux/=2;
        lg--;
        ras=max(
        max(rmq[i][j][lg],rmq[i][j+k-po[lg]][lg]),
        max(rmq[i+k-po[lg]][j][lg],rmq[i+k-po[lg]][j+k-po[lg]][lg]));
        fprintf(out,"%d\n",ras);
    }
}