#include <cstdio>
#include <iostream>
#define INF 200000000
using namespace std;

FILE *fin = fopen("plantatie.in" ,"r");
FILE *fout= fopen("plantatie.out","w");

int n, m, i, j, k, ok, minim;
int d[1000][1000][10],v[513];
int x, y, z, t, p, pow,maxim;

void SetUp(){
    fscanf(fin, "%d%d", &n, &m);
    for(i = 1; i <= n; i ++)
        for(j = 1; j <= n; j ++)
            fscanf(fin, "%d", &d[i][j][0]);
    for(i = 2; i <= n; i ++)
        v[i] = 1 + v[i/2];
    for(k = 1; (1<<k) <= n; k ++)
        for(i = 1; i <= n; i ++)
            for(j = 1; j <= n; j ++){
                pow = (1<<(k-1));
                d[i][j][k] = d[i][j][k-1];
                if(i+pow <= n && d[i+pow][j][k-1] > d[i][j][k])
                    d[i][j][k] = d[i+pow][j][k-1];
                if(j+pow <= n && d[i][j+pow][k-1] > d[i][j][k])
                    d[i][j][k] = d[i][j+pow][k-1];
                if(i+pow <= n && j+pow <= n)
                    if(d[i+pow][j+pow][k-1] > d[i][j][k])
                        d[i][j][k] = d[i+pow][j+pow][k-1];
            }
    return;
}

void Query(){
    for(t = 1; t <= m; t ++){
        fscanf(fin, "%d%d%d", &x, &y, &z);
        p = v[z]; pow = (1<<p); maxim = d[x][y][p];
        if(maxim < d[x+p-pow][j][p])
            maxim = d[x+p-pow][j][p];
        if(maxim < d[x][y+z-pow][p])
            maxim = d[x][y+z-pow][p];
        if(maxim < d[x+z-pow][y+z-pow][p])
            maxim = d[x+z-pow][y+z-pow][p];
        fprintf(fout, "%d\n", maxim);
    }
    return;
}

int main(){
    SetUp();
    Query();
    return 0;
}