#include <iostream>
#include <fstream>

using namespace std;

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

const int N_MAX = 500;
int rmq[8][N_MAX + 1][N_MAX + 1], n, q;

int mx4(int a, int b, int c, int d) {
    return max(max(a, b), max(c, d));
}

int main() {
    fin >> n >> q;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            fin >> rmq[0][i][j];
        }
    }
    for(int k = 1; (1 << k) <= n; k++) {
        for(int i = 1; i <= n - (1 << k) + 1; i++) {
            for(int j = 1; j <= n - (1 << k) + 1; j++) {
                int pk = 1 << (k - 1);
                rmq[k][i][j] = mx4(rmq[k-1][i][j], rmq[k-1][i + pk][j], rmq[k-1][i][j + pk], rmq[k-1][i + pk][j + pk]);
            }
        }
    }

    for(int i = 1; i <= q; i++) {
        int x, y, len;
        fin >> x >> y >> len;
        int p = 31 - __builtin_clz(len);
        int p2 = len - (1 << p);
        fout << mx4(rmq[p][x][y], rmq[p][x + p2][y], rmq[p][x][y + p2], rmq[p][x + p2][y + p2]) << '\n';
    }

    return 0;
}