#include <fstream>

using namespace std;

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

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

int main(){
    fin >> n >> m;
    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++){
            fin >> A[0][i][j];
        }
    }
    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[k][i][j] = max (max (A[k-1][i][j], A[k-1][i+(1<<(k-1))][j]), max (A[k-1][i+(1<<(k-1))][j+(1<<(k-1))], A[k-1][i][j+(1<<(k-1))]));
            }
        }
    }
    for (i=1; i<=m; i++){
        fin >> x >> y >> k;
        X = x + k - 1;
        Y = y + k - 1;
        p = l[k];
        P = (1<<p);
        fout << max (max(A[p][x][y], A[p][X-P+1][y]), max(A[p][X-P+1][Y-P+1], A[p][x][Y-P+1])) << "\n";
    }
    return 0;
}