#include<fstream>
#define inf "plantatie.in"
#define outf "plantatie.out"
#define NMax 501
#define LMax 10
#define MINF -0x3f3f3f3f
using namespace std;

fstream f(inf,ios::in),g(outf,ios::out);

int m[NMax][NMax][LMax];
int lg[NMax];
int N,M;

void Citire()
{
f>>N>>M;
for(int i=1;i<=N;i++)
    for(int j=1;j<=N;j++)f>>m[i][j][0];
lg[1]=0;
for(int i=2;i<=N;i++)lg[i]=lg[i/2]+1;
}

int maximum(int a,int b,int c,int d)
{
int rez=MINF;
if(rez<a)rez=a;
if(rez<b)rez=b;
if(rez<c)rez=c;
if(rez<d)rez=d;
return rez;
}

void Rezolvare()
{
for(int k=1; (1<<k)<=N;k++)
    {
    for(int i=1;i+(1<<k)-1<=N;i++)
        {
        for(int j=1;j+(1<<k)-1<=N;j++)
            {
            m[i][j][k]=maximum(m[i][j][k-1],m[i][j+(1<<(k-1))][k-1],m[i+(1<<(k-1))][j+(1<<(k-1))][k-1],m[i+(1<<(k-1))][j][k-1]);
            }
        }
    }
}

int raspunde(int x,int y,int k)
{
int l=lg[k];
int d=(1<<l);
return maximum(m[x][y][l],m[x][y+k-d][l],m[x+k-d][y][l],m[x+k-d][y+k-d][l]);
}

int main()
{
int x,y,k;
Citire();
Rezolvare();
for(int i=1;i<=M;i++)
    {
    f>>x>>y>>k;
    g<<raspunde(x,y,k)<<"\n";
    }
f.close();
g.close();
return 0;
}