#include <fstream>
#include <math.h>
#define inf 1000000001
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

int a[501][501][12],n,m;
int main()
{
    fin>>n>>m;
    int i,j,k,x,y,z,sol;
    for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
           fin>>a[i][j][0];

    for(k=1;(1<<k)<=n;++k)
         for(i=1;i+(1<<k)-1 <=n;++i)
           for(j=1;j+(1<<k)-1 <=n;++j)
           a[i][j][k]=max(a[i][j][k-1],max(a[i+(1<<(k-1))][j][k-1],max(a[i][j+(1<<(k-1))][k-1],a[i+(1<<(k-1))][j+(1<<(k-1))][k-1])));
    for(i=1;i<=m;++i)
    {  fin>>x>>y>>k;
        z=log2(k); sol=inf;
        sol=max(a[x][y][z], a[x][y+k-(1<<z)][z]);
        sol=max(sol,a[x+k-(1<<z)][y][z]);
        sol=max(sol,a[x+k-(1<<z)][y+k-(1<<z)][z]);
        fout<<sol<<"\n";
    }

    return 0;
}