#include <iostream>
#include <fstream>
using namespace std;

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

#define NMAX 501
int rmq[10][NMAX][NMAX];
int lg[NMAX];

int main()
{
    int n, m, l;
    fin >> n >> m;

    lg[1] = 0;
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;

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

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

    for (int q = 1; q <= m; ++q)
    {
        int i, j, k, sh;
        fin >> i >> j >> k;
        l = lg[k];
        sh = 1 << l;

        fout << max(rmq[l][i][j], max(rmq[l][i][j + k - sh], max(rmq[l][i + k - sh][j], rmq[l][i + k - sh][j + k - sh]))) << '\n';
    }

    return 0;
}