#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[13][505][505], x, p;
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 >> rmq[0][i][j];
        }
    }
    for(int p = 1, lat = 2; lat <= n; lat <<= 1, ++p)
    {
        for(int i = 1; i <= n - lat + 1; ++i)
        {
            for(int j = 1; j <= n - lat + 1; ++j)
            {
                int inou = i + (lat >> 1);
                int jnou = j + (lat >> 1);
                rmq[p][i][j] = max(rmq[p - 1][inou][j], rmq[p - 1][i][jnou]);
                rmq[p][i][j] = max(rmq[p - 1][i][j], rmq[p][i][j]);
                rmq[p][i][j] = max(rmq[p][i][j], rmq[p - 1][inou][jnou]);
            }
        }
    }
    while(queries--)
    {
        fin >> st >> dr >> k;
        int e = log(k);
        int l = (1 << e);
        int inou = st + k - l;
        int jnou = dr + k - l;
        fout << max(max(max(rmq[k][st][jnou], rmq[k][inou][dr]), rmq[k][inou][jnou]), rmq[k][st][dr]) << '\n';
    }
    return 0;
}