#include <fstream>
#include <algorithm>

int rmq[9][501][501];
int log2[501];

int main() {
    std::ifstream fin("plantatie.in");
    std::ofstream fout("plantatie.out");
    int n, m;

    fin >> n >> m;
    log2[1] = 0;
    for (int i = 2; i <= n; i++) {
        log2[i] = 1 + log2[i / 2];
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            fin >> rmq[0][i][j];
        }
    }

    int log = log2[n];
    for (int i = 1; i <= log; i++) {
        int half = (1 << (i - 1));
        for (int j = (1 << i); j <= n; j++) {
            for (int k = (1 << i); k <= n; k++) {
                rmq[i][j][k] = std::max(std::max(rmq[i - 1][j][k], rmq[i - 1][j][k - half]), std::max(rmq[i - 1][j - half][k], rmq[i - 1][j - half][k - half]));
            }
        }
    }

    for (; m > 0; m--) {
        int a, b, latura;
        fin >> a >> b >> latura;
        a += latura - 1;
        b += latura - 1;
        int l = log2[latura];
        int half = 1 << (l - 1);
        fout << std::max(std::max(rmq[l][a][b], rmq[l][a][b - latura + half + 1]), std::max(rmq[l][a - latura + half + 1][b], rmq[l][a - latura + half + 1][b - latura + half + 1])) << '\n';
    }
    return 0;
}