#include <fstream>
using namespace std;

ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

int l[5001];
int n,m,i,j,k,v[501][501][20];

int main(){
    fin>>n>>m;

    for(i=2;i<=n;i++){
        l[i]=1+l[i/2];
    }

    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>v[i][j][0];

    for(k=1;k<=l[n]+1;k++){
        for(i=1;i<=n;i++){
            for(j=1;j<=n;j++){
                v[i][j][k]=v[i][j][k-1];///aceeasi pozitie dim 2^k-1
                if(i+(1<<(k-1))<=n && v[i+(1<<(k-1))][j][k-1]>v[i][j][k]){
                    v[i][j][k]=v[i+(1<<(k-1))][j][k-1];
                }
                if(j+(1<<(k-1))<=n && v[i][j+(1<<(k-1))][k-1]>v[i][j][k]){
                    v[i][j][k]=v[i][j+(1<<(k-1))][k-1];
                }
                if(i+(1<<(k-1))<=n && j+(1<<(k-1))<=n && v[i+(1<<(k-1))][j+(1<<(k-1))][k-1]>v[i][j][k])
                    v[i][j][k]=v[i+(1<<(k-1))][j+(1<<(k-1))][k-1];
            }
        }
    }

    for(;m;m--){
        fin>>i>>j>>k;
        fout<<max(v[i][j][l[k]],max(v[i+k-(1<<l[k])][j][l[k]],max(v[i][j+k-(1<<l[k])][l[k]],v[i+k-(1<<l[k])][j+k-(1<<l[k])][l[k]])))<<"\n";
    }

    ///fout<<v[4][5][2];

    return 0;
}