#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

const string inputFilename = "plantatie.in";
const string outputFilename = "plantatie.out";

int main() {
    ifstream fin(inputFilename);
    if (!fin) {
        cerr << "Failed to open the input file." << endl;
        return 1;
    }

    ofstream fout(outputFilename);
    if (!fout) {
        cerr << "Failed to open the output file." << endl;
        return 1;
    }

    int N, M;
    fin >> N >> M;

    vector<vector<int>> A(N + 1, vector<int>(N + 1));

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

    for (; M > 0; --M) {
        int i, j, k;
        fin >> i >> j >> k;

        int ret = 0;
        int maxRow = min(i + k - 1, N);
        int maxCol = min(j + k - 1, N);

        for (int row = i; row <= maxRow; ++row) {
            for (int col = j; col <= maxCol; ++col) {
                ret = max(ret, A[row][col]);
            }
        }

        fout << ret << endl;
    }

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

    return 0;
}