#include <bits/stdc++.h>

using namespace std;

ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n, m, k, q, x, y, z, i, j;
int rmq[502][502][10], lg[502];

static inline void Rmq() {
    for(int i = 2; i <= 500; i++) lg[i] = lg[(i >> 1)] + 1;

    for(int k = 1; (1 << k) <= n; k++) {
        int p = (1 << (k - 1));
        for(int i = 1; i + (1 << k) - 1 <= n; i++) {
            for(int j = 1; j + (1 << k) - 1 <= n; j++)
                rmq[i][j][k] = max(max(rmq    [i][j][k - 1], rmq[i + p][j + p][k - 1]),
                                   max(rmq[i + p][j][k - 1], rmq    [i][j + p][k - 1]));
        }
    }

}

static inline int query(int i, int j, int k) {
    int l = lg[k];
    int p = (1 << l);
    return max(max(rmq[i][j][l], rmq[i + k - p][j + k - p][l]), max(rmq[i + k - p][j][l], rmq[i][j + k - p][l]));
}

int main() {
    fin >> n >> q;
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) fin >> rmq[i][j][0];
    }
    Rmq();
    while(q--) {
        fin >> x >> y >> z;
        fout << query(x, y, z) << "\n";
    }

    return 0;
}