#include <fstream>

using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int r[10][505][505],i,p,l[505],j,k,x,n,m;
int main()
{
    f>>n>>m;
    for(i=2;i<=n;i++)
        l[i]=l[i/2]+1;
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
        f>>r[0][i][j];
    p=l[n];
    for(i=1;i<=p;i++)
        for(j=1;j+(1<<i)-1<=n;j++)
        for(k=1;k+(1<<i)-1<=n;k++)
            r[i][j][k]=max(max(r[i-1][j][k],r[i-1][j+(1<<i-1)][k+(1<<i-1)]),max(r[i-1][j][k+(1<<i-1)],r[i-1][j+(1<<i-1)][k]));
    for(k=1;k<=m;k++){
        f>>i>>j>>x;
        p=l[x];
        g<<max(max(r[p][i][j],r[p][i][j+x-1-(1<<p)+1]),max(r[p][i+x-1-(1<<p)+1][j],r[p][i+x-1-(1<<p)+1][j+x-1-(1<<p)+1]))<<"\n";
    }
    return 0;
}