#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

const int NMAX = 500, LOGMAX = 9;

int spTbl[NMAX][NMAX][LOGMAX + 1];
int log2[NMAX + 1];
int mat[NMAX][NMAX];

void initLog2(int n);
void initSpTbl(int n);
int query(int l, int c, int len);

int main()
{
    int n, m, l, c, len;

    fin >> n >> m;
    for (l = 0; l < n; l++)
        for (c = 0; c < n; c++)
            fin >> mat[l][c];

    initLog2(n);
    initSpTbl(n);

    for (int i = 0; i < m; i++) {
        fin >> l >> c >> len;
        fout << query(l - 1, c - 1, len) << '\n';
    }

    return 0;
}

void initLog2(int n) {
    int pow2 = 0;
    for (int i = 1; i <= n; i++) {
        if ((1 << (pow2 + 1)) == i)
            pow2++;
        log2[i] = pow2;
    }
}

void initSpTbl(int n) {
    for (int l = 0; l < n; l++)
        for (int c = 0; c < n; c++)
            spTbl[l][c][0] = mat[l][c];

    for (int pow2 = 1; pow2 <= log2[n]; pow2++)
        for (int l = 0; l < n - (1 << pow2) + 1; l++)
            for (int c = 0; c < n - (1 << pow2) + 1; c++) {
                spTbl[l][c][pow2] = max(max(spTbl[l][c][pow2 - 1],
                                            spTbl[l + (1 << (pow2 - 1))][c][pow2 - 1]),
                                        max(spTbl[l][c + (1 << (pow2 - 1))][pow2 - 1],
                                            spTbl[l + (1 << (pow2 - 1))][c + (1 << (pow2 - 1))][pow2 - 1]));
            }
}
int query(int l, int c, int len) {
    return max(max(spTbl[l][c][log2[len]],
                   spTbl[l][c + len - (1 << log2[len])][log2[len]]),
               max(spTbl[l + len - (1 << log2[len])][c][log2[len]],
                   spTbl[l + len - (1 << log2[len])][c + len - (1 << log2[len])][log2[len]]));
}