#include <iostream>
#include <cstdio>
using namespace std;
const int NMAX = 501;
int tabel[NMAX][NMAX][9];
int area[NMAX][NMAX];
int log[NMAX];
int min(int a, int b){
    return a < b ? a : b;
}
int max(int a, int b, int c, int d){
    if(a >= b && a >= c && a >= d)
        return a;
    if(b >= a && b >= c && b >= d)
        return b;
    if(c >= a && c >= b && c >= d)
        return c;
    return d;
}
int rmq(int x, int y, int k){
    int slice = log[k];
    int ramase = k - (1<<slice);
    return max(tabel[x][y][slice], tabel[x+ramase][y][slice],
               tabel[x][y+ramase][slice],tabel[x+ramase][y+ramase][slice]);
}
int main()
{
    FILE *fin, *fout;
    int n,m,i,j,k,x,y,ans;
    fin = fopen("plantatie.in","r");
    fout = fopen("plantatie.out","w");
    fscanf(fin,"%d %d",&n,&m);
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fscanf(fin,"%d",&area[i][j]);
    log[1] = 0;
    for(i=2;i<=n;i++)
        log[i] = log[i / 2] + 1;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            tabel[i][j][0] = area[i][j];
    for(k=1;(1<<k)<=n;k++)
        for(i=1;(i+(1<<k)-1)<=n;i++)
            for(j=1;(j+(1<<k)-1)<=n;j++)
                tabel[i][j][k] = max(tabel[i][j][k-1], tabel[i][j+(1<<(k-1))][k-1],
                                     tabel[i+(1<<(k-1))][j][k-1], tabel[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
    for(i=1;i<=m;i++){
        fscanf(fin,"%d %d %d",&x,&y,&k);
        ans = rmq(x,y,k);
        fprintf(fout,"%d\n",ans);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}