#include <cstdio>
#include <iostream>
#define DIMBUFF 100005

using namespace std;

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

int n, m, i, j, x, y, k, X, Y, p, P;
int l[505], A[505][505][20];

char buff[DIMBUFF];
int pp;

int numar() {
    int val = 0;
    while (!(buff[pp] >= '0' && buff[pp] <= '9')) {
        pp++;
        if (pp == DIMBUFF) {
            fread(buff, 1, DIMBUFF, fin);
            pp=0;
        }
    }
    while (buff[pp] >= '0' && buff[pp] <= '9') {
        val = val*10 + buff[pp] - '0';
        pp++;
        if (pp == DIMBUFF) {
            fread(buff, 1, DIMBUFF, fin);
            pp=0;
        }
    }
    return val;
}

int main(){
    fread(buff, 1, DIMBUFF, fin);
    n = numar();
    m = numar();
    l[1] = 0;
    for (i=2; i<=n; i++){
        l[i] = l[i/2] + 1;
    }
    for (i=1; i<=n; i++){
        for (j=1; j<=n; j++){
            A[i][j][0] = numar();
        }
    }
    for (k=1; k<=l[n]+1; k++){
        for (i=1; i+(1<<(k-1))<=n; i++){
            for (j=1; j+(1<<(k-1))<=n; j++){
                A[i][j][k] = max (max (A[i][j][k-1], A[i+(1<<(k-1))][j][k-1]), max (A[i+(1<<(k-1))][j+(1<<(k-1))][k-1], A[i][j+(1<<(k-1))][k-1]));
            }
        }
    }
    for (i=1; i<=m; i++){
        x = numar();
        y = numar();
        k = numar();
        X = x + k - 1;
        Y = y + k - 1;
        p = l[k];
        P = (1<<p);
        fprintf (fout, "%d\n", max (max(A[x][y][p], A[X-P+1][y][p]), max(A[X-P+1][Y-P+1][p], A[x][Y-P+1][p])));
    }
    return 0;
}