#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    ifstream f("plantatie.in");
    int N, M;
    f >> N >> M;

    vector<vector<int>> productivity(N, vector<int>(N));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            f >> productivity[i][j];
        }
    }

    ofstream g("plantatie.out");
    for (int i = 0; i < M; i++) {
        int query_i, query_j, query_k;
        f >> query_i >> query_j >> query_k;

        int max_productivity = 0;
        for (int row = query_i - 1; row < query_i - 1 + query_k; row++) {
            max_productivity = max(max_productivity, *max_element(productivity[row].begin() + query_j - 1, productivity[row].begin() + query_j - 1 + query_k));
        }
        g << max_productivity << endl;
    }

    f.close();
    g.close();

    return 0;
}