#include <fstream>

using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int a[10][505][505],i,p,log[505],j,k,x,n,m;
int main()
{
    fin>>n>>m;
    log[1]=0;
    for(i=2;i<=n;i++)
        log[i]=log[i/2]+1;
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
        fin>>a[0][i][j];
    p=log[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++)
            a[i][j][k]=max(max(a[i-1][j][k],a[i-1][j+(1<<i-1)][k]),max(a[i-1][j][k+(1<<i-1)],a[i-1][j+(1<<i-1)][k+(1<<i-1)]));
    while(m)
    {
        m--;
        fin>>i>>j>>x;
        p=log[x];
        fout<<max(max(a[p][i][j],a[p][i][j+x-1-(1<<p)+1]),max(a[p][i+x-1-(1<<p)+1][j],a[p][i+x-1-(1<<p)+1][j+x-1-(1<<p)+1]))<<"\n";
    }
    return 0;
}