#include <bits/stdc++.h>

using namespace std;

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

int n, m, rmq[502][502][10], l[502];

int Getmaxim(int i, int j, int k)
{
    int logg = l[k];
    int a = (1 << logg);
    int maxx = rmq[i][j][logg];
    maxx = max(maxx, rmq[i + k - a][j][logg]);
    maxx = max(maxx, rmq[i][j + k - a][logg]);
    maxx = max(maxx, rmq[i + k - a][j + k - a][logg]);
    return maxx;
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            fin >> rmq[i][j][0];
    for (int i = 2; i <= n; ++i)
        l[i] = l[i / 2] + 1;
    for (int k = 1; (1 << k) <= n; ++k)
        for (int i = 1; i + (1 << k) - 1 <= n; ++i)
            for (int j = 1; j + (1 << k) - 1 <= n; ++j)
                rmq[i][j][k] = max(rmq[i][j][k - 1], max(rmq[i + (1 << (k - 1))][j][k - 1], max(rmq[i][j + (1 << (k - 1))][k - 1], rmq[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1])));
    while (m--)
    {
        int i, j, k;
        fin >> i >> j >> k;
        fout << Getmaxim(i, j, k) << "\n";
    }
    return 0;
}