#include <fstream>

#define NMAX 505
#define LOG 11

using namespace std;

ifstream f("plantatie.in");
ofstream g("plantatie.out");

int n, questions, x, y, l;
int sparseTable[LOG][NMAX][NMAX];

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

void getSparseTable() {

    for (int l = 1; (1 << l) <= n; l++) {

        for (int i = 1; i + (1 << l) - 1 <= n; i++) {

            for(int j = 1; j + (1 << l) - 1 <= n; j++) {
                sparseTable[l][i][j] = getMax(sparseTable[l - 1][i][j], sparseTable[l - 1][i + (1 << (l - 1))][j],
                                              sparseTable[l - 1][i][j + (1 << (l - 1))],
                                              sparseTable[l - 1][i + (1 << (l - 1))][j + (1 << (l - 1))]);
            }
        }
    }
}

int getRMQ(int x1, int y1, int length) {
    int x2 = x1 + length - 1;
    int y2 = y1 + length - 1;
    int log = 0;

    while ((1 << log) <= length)
        log++;
    log--;

    return getMax(sparseTable[log][x1][y1], sparseTable[log][x1][y2 - (1 << log) + 1],
                  sparseTable[log][x2 - (1 << log) + 1][y1], sparseTable[log][x2 - (1 << log) + 1][y2 - (1 << log) + 1]);
}

int main()
{
    f >> n >> questions;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            f >> sparseTable[0][i][j];
        }
    }

    getSparseTable();

    while (questions--) {
        f >> x >> y >> l;

        g << getRMQ(x, y, l) << "\n";
    }

    return 0;
}