#include <bits/stdc++.h>

using namespace  std;
const int nmax = 1001;
const int lg = 100;
int n,m,l,r, lat;
int RMQ[lg][nmax][nmax];
int E[nmax];
int i,j;

void preprocess(){
    for(int l=1; (1<<l)<=n; l++){
        for(int i=1; i<=n;i++)
            for(int j=1;j<=n;j++){
            RMQ[l][i][j] = RMQ[l-1][i][j];
            int ii = i + (1<<(l-1));
            int jj = j + (1<<(l-1));
            if(jj <= n && ii <= n) RMQ[l][i][j] = max(RMQ[l][i][j], RMQ[l-1][ii][jj]);
            if(jj <= n) RMQ[l][i][j] = max(RMQ[l][i][j], RMQ[l-1][i][jj]);
            if(ii <= n) RMQ[l][i][j] = max(RMQ[l][i][j], RMQ[l-1][ii][j]);
        }
    }
    for(int i=2;i<=n;i++) E[i] = 1 + E[i/2];
}
int main(){
    freopen("plantatie.in","r",stdin);
    freopen("plantatie.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for( int j=1;j<=n;j++)
            cin>>RMQ[0][i][j];
    preprocess();

    for(int q=1;q<=m;q++){
        cin>>  i >> j >> lat;
        int e = E[lat];
        cout<<max(RMQ[e][i][j],
            max(RMQ[e][i + lat - (1<<e)][j + lat - (1<<e)],
                max(RMQ[e][i][j + lat - (1<<e)],
                    RMQ[e][i + lat - (1<<e)][j])))<<'\n';
    }
}