#include <fstream>
#define INF 200000000
using namespace std;

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

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

int max(int x, int y, int z, int t){
    if(x > y && x > z && x > t) return x;
    if(y > x && y > z && y > t) return y;
    if(z > x && z > y && z > t) return z;
    if(t > x && t > y && t > z) return t;
}

void SetUp(){
    fin >> n >> m;
    for(i = 1; i <= n; i ++)
        for(j = 1; j <= n; j ++)
            fin >> 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 ++)
                d[i][j][k] = max(d[i][j][k-1], d[i+(1<<(k-1))][j][k-1], d[i][j+(1<<(k-1))][k-1], d[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
                //DON'T TRY TO UNDERSTAND!
    return;
}

void Query(){
    for(t = 1; t <= m; t ++){
        fin >> x >> y >> z;
        p = v[z];
        fout << max(d[x][y][p], d[x+z-(1<<p)][y][p], d[x][y+z-(1<<p)][p], d[x+z-(1<<p)][y+z-(1<<p)][p]) << "\n";
    }
    return;
}

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