#include <fstream>

using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int a[]={0,0,1,1},b[]={0,1,0,1};
int n,q,c,m[10][501][501],lg[502],d,lu,i,j,z,st,dr,k,nr;
int main()
{
    f>>n>>q;
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            f>>m[0][i][j];
    for (i=1;(lu=1<<i)<=n;i++)
        for (j=1;j+lu-1<=n;j++)
            for (z=1;z+lu-1<=n;z++)
            {
                for (d=0;d<=3;d++)
                    m[i][j][z]=max(m[i-1][j+((a[d]*lu)>>1)][z+((b[d]*lu)>>1)],m[i][j][z]);
            }
    for (j=2;j<=n;j++)
        lg[j]=lg[j/2]+1;
    for (i=1;i<=q;i++)
    {
        f>>st>>dr>>k;
        nr=lg[k];
        g<<max(m[nr][st][dr],max(m[nr][st+k-(1<<nr)][dr],max(m[nr][st][dr+k-(1<<nr)],m[nr][st+k-(1<<nr)][dr+k-(1<<nr)])))<<'\n';
    }
    return 0;
}