#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int rmq[20][501][501], lg[501];

int main()
{
    in >> n >> m;
    for (int i = 2; i <= n; ++i)
        lg[i] = 1 + lg[i / 2];
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
            in >> rmq[0][i][j];
    }
    for (int l = 1; (1 << l) <= n; ++l)
    {
        for (int i = 1; i + (1 << l) <= n + 1; ++i)
        {
            for (int j = 1; j + (1 << l) <= n + 1; ++j)
            {
                int salt = 1 << (l - 1);
                rmq[l][i][j] = max(max(rmq[l - 1][i][j], rmq[l - 1][i + salt][j]), max(rmq[l - 1][i][j + salt], rmq[l - 1][i + salt][j + salt]));
            }
        }
    }
    int x, y, k;
    while (m--)
    {
        in >> x >> y >> k;
        int l = lg[k], salt = (1 << l), diff = k - salt;
        out << max(max(rmq[l][x][y], rmq[l][x + diff][y]), max(rmq[l][x][y + diff], rmq[l][x + diff][y + diff])) << '\n';
    }
    return 0;
}