#include <bits/stdc++.h>

using namespace std;

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

int n,q,A[505][505][10],i,j,x,k,nr,st,dr,lungime;

int main()
{
fin>>n>>q;
for(i=1;i<=n;i++){
    for(j=1;j<=n;j++){
        fin>>x;
        A[i][j][0] = x;
    }
}
for(k=1;k<=10;k++){
    nr = (1 << (k - 1));
    for(i=1;i+ (1<<k) - 1 <=n;i++){
        for(j=1;j + (1 << k) - 1 <=n;j++){
            A[i][j][k] = max(max(max(A[i][j][k-1],A[i][j+nr][k-1]),A[i+nr][j][k-1]),A[i+nr][j+nr][k-1]);
        }
    }
}
for(i=1;i<=q;i++){
    fin>>st>>dr>>lungime;
    k = 0;
    while(1 << k <= lungime){
        k++;
    }
    nr = (1 << (k - 1));
    fout << max(max(max(A[st][dr][k-1],A[st+lungime-nr][dr][k-1]),A[st][dr+lungime-nr][k-1]),A[st+lungime-nr][dr+lungime-nr][k-1]) << '\n';
}
    return 0;
}