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

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

const int NMAX=505;

int n,Q,a[NMAX][NMAX],dp[NMAX][NMAX][10],logaritm[NMAX];
//dp[i][j][k]=maximul din patratul cu coltul stanga-sus i,j si de latura 2^k

inline void RMQ2D()
{
    int i,j,l;
    logaritm[2]=1;
    for (i=3;i<NMAX;i++) logaritm[i]=logaritm[i>>1]+1;
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            dp[i][j][0]=a[i][j];
    for (l=1;l<=logaritm[n];l++)
        for (i=1;i<=(n-(1<<l)+1);i++)
            for (j=1;j<=(n-(1<<l)+1);j++)
                {
                    dp[i][j][l]=max(dp[i][j][l-1],dp[i][j+(1<<(l-1))][l-1]);
                    dp[i][j][l]=max(dp[i][j][l],dp[i+(1<<(l-1))][j][l-1]);
                    dp[i][j][l]=max(dp[i][j][l],dp[i+(1<<(l-1))][j+(1<<(l-1))][l-1]);
                }
}

int main()
{
    int i,j,x,y,z,aux,dif;
    fin>>n>>Q;
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            fin>>a[i][j];
    RMQ2D();
    for (i=1;i<=Q;i++)
        {
            fin>>x>>y>>z;
            dif=logaritm[z];
            aux=max(dp[x][y][dif],dp[x][y+(z-(1<<dif))][dif]);
            aux=max(aux,dp[x+(z-(1<<dif))][y][dif]);
            aux=max(aux,dp[x+(z-(1<<dif))][y+(z-(1<<dif))][dif]);
            fout<<aux<<"\n";
        }
    return 0;
}