#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[505][505][20];

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