#include<fstream>
#include<algorithm>
using namespace std;

int i,j,n,m,d[501][501][10],k,x,y,t,b[501];
int main()
{
    ifstream f("plantatie.in");
    ofstream g("plantatie.out");
    f>>n>>m;
    for(i=1;i<=n;++i)
    for(j=1;j<=n;++j)
    f>>d[i][j][0];
    for(i=1;i<=n;++i)
    if(i>1)
    b[i]=b[i>>1]+1;

    for(k=1;k<=b[n];++k)
    {
        t=1<<(k-1);
        for(i=1;i<=n-t;++i)
        for(j=1;j<=n-t;++j)
            d[i][j][k]=max(d[i][j][k-1],max(d[i][j+t][k-1],max(d[i+t][j][k-1],d[i+t][j+t][k-1])));
    }

    for(i=1;i<=m;++i)
    {
        f>>x>>y>>k;
        t=b[k];
        g<<max(d[x][y][t],max(d[x][y+k-(1<<t)][t],max(d[x+k-(1<<t)][y][t],d[x+k-(1<<t)][y+k-(1<<t)][t])))<<"\n";
    }
    return 0;
}