#include<fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n,i,j,k,m,l,c,i1,i2,j1,j2,sol;
int L[1005];
int D[1005][1005][15];
int main(){
    fin>>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++){
            fin>>D[i][j][0];
        }
    }
    for(k=1;k<=L[n];k++){
        for(i=1;i<=n;i++){
            for(j=1;j<=n;j++){
                D[i][j][k]=D[i][j][k-1];
                D[i][j][k]=max(D[i][j][k],D[i][j+(1<<(k-1))][k-1]);
                D[i][j][k]=max(D[i][j][k],D[i+(1<<(k-1))][j][k-1]);
                D[i][j][k]=max(D[i][j][k],D[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
            }
        }
    }
    for(i=1;i<=m;i++){
        fin>>i1>>j1>>c;
        i2=i1+c-1;
        j2=j1+c-1;
        l=L[c-1];
        sol=D[i1][j1][l];
        sol=max(sol,D[i1][j2-(1<<l)+1][l]);
        sol=max(sol,D[i2-(1<<l)+1][j1][l]);
        sol=max(sol,D[i2-(1<<l)+1][j2-(1<<l)+1][l]);
        fout<<sol<<"\n";
    }
    return 0;
}