#include <cstdio>
#include <fstream>
#include <vector>
#include <algorithm>

const int NMAX = 512;

int N, M;
std::vector<std::vector<int>> A;

int query(int u, int v, int d) {
    int ret = 0;
    for (int i = u; i < u + d; ++i) {
        for (int j = v; j < v + d; ++j) {
            ret = std::max(ret, A[i][j]);
        }
    }
    return ret;
}

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

    fin >> N >> M;

    A.resize(N + 1, std::vector<int>(N + 1));

    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) {
            fin >> A[i][j];
        }
    }

    for (int i = 0; i < M; ++i) {
        int u, v, d;
        fin >> u >> v >> d;
        int result = query(u, v, d);
        fout << result << "\n";
    }

    fin.close();
    fout.close();

    return 0;
}