#include <bits/stdc++.h>

using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
const int nmax = 505;
int n, m, lg[nmax + 10], rmq[nmax][nmax][21];

void logaritm()
{
    lg[1] = 0;
    for(int i = 2; i <= n; ++i)
        lg[i] = 1 + lg[i >> 1];
}
void RMQ()
{
    int N = lg[n];
    for(int k = 1; k <= N; ++k)
        for(int i = 1; i <= n - (1 << (k - 1)); ++i)
            for(int j = 1; j <= n - (1 << (k - 1)); ++j)
            {
                int p = 1 << (k - 1);
                rmq[i][j][k] = max(max(rmq[i][j][k - 1], rmq[i + p][j][k - 1]), max(rmq[i][j + p][k - 1], rmq[i + p][j + p][k - 1]));
            }
}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
           fin >> rmq[i][j][0];
    logaritm();
    RMQ();
    while(m--)
    {
        int x, y, k;
        fin >> x >> y >> k;
        int p = lg[k];
        int lung = k - (1 << p);
        int maxim = max(max(rmq[x][y][p], rmq[x][y + lung][p]), max(rmq[x + lung][y][p], rmq[x + lung][y + lung][p]));
        fout << maxim << "\n";
    }
    return 0;
}