#include <iostream>
#include <fstream>

using namespace std;

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

const int maxn = 505;
int n, m, x, y;
int i, v[maxn], j;
int rmq[25][maxn][maxn];
int loga[maxn];
int a[maxn][maxn], k, h;

int query(int x, int y, int k) {
    int lgk = loga[k];
    return max(rmq[lgk][x][y], max(rmq[lgk][x + k - (1 << lgk)][y],
                                   max(rmq[lgk][x][y + k - (1 << lgk)],
                                       rmq[lgk][x + k - (1 << lgk)][y + k - (1 << lgk)])));
}

int main()
{
    fin >> n >> m;
    for(i = 1; i <= n; i ++) {
        for(j = 1; j <= n; j ++) {
            fin >> a[i][j];
            rmq[0][i][j] = a[i][j];
        }
    }
    for(i = 2; i <= n; i ++) {
        loga[i] = loga[i >> 1] + 1;
    }
    for(i = 1; (1 << i) <= n; i ++) {
        for(j = 1; j + (1 << i) - 1 <= n; j ++) {
            for(h = 1; h + (1 << i) - 1 <= n; h ++) {
                rmq[i][j][h] = max(rmq[i-1][j][h], max(rmq[i-1][j + (1 << (i-1))][h],
                                                       max(rmq[i-1][j][h + (1 << (i-1))],
                                                           rmq[i-1][j + (1 << (i-1))][h + (1 << (i-1))])));
            }
        }
    }

    for(i = 1; i <= m; i ++) {
        fin >> x >> y >> k;
        fout << query(x, y, k) << '\n';
    }

    fin.close();
    fout.close();
    return 0;
}