#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#include <bits/stdc++.h>
using namespace std;
int n, queries, st, dr, k, rmq[11][501][501], x, p, a, aux;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int32_t main(int argc, char * argv[])
{
    fin >> n >> queries;
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            fin >> a;
             rmq[0][i][j] = a;
        }
    }
    for(int p = 1; (1 << p) <= n; ++p)
    {
        for(int i = 1; i <= n; ++i)
        {
            for(int j = 1; j <= n; ++j)
            {
                int lat = (1 << p);
                int inou = i + (lat >> 1);
                int jnou = j + (lat >> 1);
               rmq[p][i][j] = max(max(max(rmq[p - 1][i][j], rmq[p - 1][inou][j]), rmq[p - 1][i][jnou]), rmq[p - 1][inou][jnou]);
            }
        }
    }
    while(queries--)
    {
        fin >> st >> dr >> k;
        int e = log2(k);
        int l = (1 << e);
        int inou = st + k - l;
        int jnou = dr + k - l;
        fout << max(max(max(rmq[e][st][jnou], rmq[e][inou][dr]), rmq[e][inou][jnou]), rmq[e][st][dr]) << '\n';
    }
    return 0;
}