/// [A][M][C][B][N] ///
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, inf = 0x3f3f3f3f;
const char sp = ' ', nl = '\n';
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

const int nmax = 500;
int mat[nmax + 2][nmax + 2], rmq[9][nmax + 2][nmax + 2];
int n, m, lg2[nmax + 2];

void build() {
    for (int i = 2; i <= n; ++i) {
        lg2[i] = lg2[i >> 1] + 1;
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            rmq[0][i][j] = mat[i][j];
        }
    }
    for (int k = 1; (1 << k) <= n; ++k) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                rmq[k][i][j] = max({
                rmq[k - 1][i][j], rmq[k - 1][i + (1 << (k - 1))][j + (1 << (k - 1))],
                rmq[k - 1][i + (1 << (k - 1))][j], rmq[k - 1][i][j + (1 << (k - 1))]
                    });
            }
        }
    }
}

int querry(int i, int j, int k) {
    int l = lg2[k];
    return max({
    rmq[l][i][j],
    rmq[l][i + k - (1 << l)][j],
    rmq[l][i][j + k - (1 << l)],
    rmq[l][i + k - (1 << l)][j + k - (1 << l)]
        });
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            fin >> mat[i][j];
        }
    }
    build();
    while (m--) {
        int i, j, k;
        fin >> i >> j >> k;
        fout << querry(i, j, k) << nl;
    }
}