#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n,m,i,j,k,l,p,i1,j1,i2,j2,len,r[10][501][501],e[501];
int main() {
    fin>>n>>m;
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            fin>>r[0][i][j];
    for (p=1,l=2;l<=n;p++,l*=2)
        for (i1=1;i1<=n-l+1;i1++)
            for (j1=1;j1<=n-l+1;j1++) {
                i2=i1+(l>>1);
                j2=j1+(l>>1);
                r[p][i1][j1]=max(max(r[p-1][i1][j1],r[p-1][i1][j2]),max(r[p-1][i2][j1],r[p-1][i2][j2]));
            }
    e[1]=0;
    for (i=2;i<=n;i++)
        e[i]=e[i/2]+1;
    while (m--) {
        fin>>i1>>j1>>l;
        k=e[l];
        len=(1<<k);
        i2=i1+l-len;
        j2=j1+l-len;
        fout<<max(max(r[k][i1][j1],r[k][i1][j2]),max(r[k][i2][j1],r[k][i2][j2]))<<"\n";
    }
    return 0;
}