#include <iostream>
#include <fstream>

using namespace std;

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

const int MAX_N = 500;
const int MAX_LOG2 = 9;

int n, m, i1, j1, i2, j2, lat, L, len, k, p;
int r[MAX_LOG2 + 1][MAX_N + 1][MAX_N + 1];
int E[MAX_N + 1];

int main()
{
    f >> n >> m;

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            f >> r[0][i][j];

    E[1] = 0;
    for (int i = 2; i <= n; i++)
        E[i] = 1 + E[(i >> 1)];

    for (p = 1, lat = 2; lat <= n; p++, lat <<= 1)
        for (int i1 = 1; i1 <= n - lat + 1; i1++)
            for (int j1 = 1; j1 <= n - lat + 1; j1++)
            {
                i2 = i1 + (lat >> 1); // i1 + (1 << (p - 1));
                j2 = j1 + (lat >> 1); // j1 + (1 << (p - 1));
                r[p][i1][j1] = max(max(r[p - 1][i1][j1], r[p - 1][i2][j1]), max(r[p - 1][i1][j2], r[p - 1][i2][j2]));
            }

    while (m--)
    {
        f >> i1 >> j1 >> L;

        k = E[L];
        len = (1 << k);
        i2 = i1 + L - len;
        j2 = j1 + L - len;

        g << max(max(r[k][i1][j1], r[k][i1][j2]), max(r[k][i2][j1], r[k][i2][j2])) << "\n";
    }

    f.close();
    g.close();
    return 0;
}