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

ifstream cin("plantatie.in");
ofstream cout("plantatie.out");

int n, m, x;
vector<vector<int>> mat;
vector<vector<vector<int>>> rmq;

int largestPowerOfTwo(int n) {
    int msb = 0;
    while (n > 1) {
        n >>= 1;
        msb++;
    }
    return msb;
}

void compute_rmq(int row) {
    int k = 0;
    while ((1 << (k + 1)) <= n) {
        vector<int> v;
        v.push_back(0);
        for (int i = 1; i + (1 << k) < rmq[row][k].size(); i++) {
            int maxi = max(rmq[row][k][i], rmq[row][k][i + (1 << k)]);
            v.push_back(maxi);
        }
        rmq[row].push_back(v);
        k++;
    }
}

int response_rmq(int row, int l, int r) {
    int k = largestPowerOfTwo(r - l + 1);
    return max(rmq[row][k][l],rmq[row][k][r-(1<<k)+1]);
}

void print_rmq(int row) {
    for (int i = 0; i < rmq[row].size(); i++) {
        for (int j = 1; j < rmq[row][i].size(); j++) {
            cout << rmq[row][i][j] << " ";
        }
        cout << endl;
    }
}


int main()
{
    cin >> n >> m;
    vector<int> v;
    v.push_back(0);
    mat.push_back(v);

    vector<vector<int>> vec;
    vec.push_back(v);
    rmq.push_back(vec);

    for (int i = 1; i <= n; i++) {
        vector<int> v;
        v.push_back(0);
        for (int j = 1; j <= n; j++) {
            cin >> x;
            v.push_back(x);
        }
        mat.push_back(v);

        vector<vector<int>> vec;
        vec.push_back(v);
        rmq.push_back(vec);

        compute_rmq(i);
    }


    int x, y, l;
    for (int i = 0; i < m; i++) {
        cin >> x >> y >> l;
        int maxi = response_rmq(x, y, y + l - 1);
        for (int j = x+1; j <= x + l - 1; j++) {
            int response = response_rmq(j, y, y + l - 1);
            maxi = max(maxi, response);
        }
        cout << maxi << endl;
    }

}