#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n,m,i,j,k,p,a,b,D[20][502][502],L[502];
int main(){
    fin>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>D[0][i][j];
    for(k=1;(1<<k)<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++){
               D[k][i][j]=D[k-1][i][j];
               p=(1<<(k-1));
               if(j+p<=n&&D[k-1][i][j+p]>D[k][i][j])
                    D[k][i][j]=D[k-1][i][j+p];
               if(i+p<=n&&D[k][i][j]<D[k-1][i+p][j])
                    D[k][i][j]=D[k-1][i+p][j];
               if(i+p<=n&&j+p<=n&&D[k][i][j]<D[k-1][i+p][j+p])
                    D[k][i][j]=D[k-1][i+p][j+p];
            }
    for(i=2;i<=n;i++)
         L[i]=1+L[i>>1];
    for(;m--;){
        fin>>a>>b>>k;
        fout<<max(D[L[k]][a][b],max(D[L[k]][a+k-(1<<L[k])][b],max(D[L[k]][a][b+k-(1<<L[k])],D[L[k]][a+k-(1<<L[k])][b+k-(1<<L[k])])))<<"\n";
    }
    return 0;
}