#include <iostream>
#include <fstream>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");
const int maxn = 1005;
int rmq[10][maxn][maxn];
int M[maxn][maxn];
int lg[maxn];

inline int query(int x, int y, int lat)
{
    int lglat = lg[lat];
    int p2 = (1 << lglat);
    int aux1 = max(rmq[lglat][x][y], rmq[lglat][x + lat - p2][y]);
    int aux2 = max(rmq[lglat][x][y + lat - p2], rmq[lglat][x + lat - p2][y + lat - p2]);
    return max(aux1, aux2);
}

int main()
{
    int n, q;
    in >> n >> q;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            in >> M[i][j];
            rmq[0][i][j] = M[i][j];
        }
    }
    for(int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for(int k = 1; k <= lg[n]; k++)
    {
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                int p = (1 << (k - 1));
                int aux1 = max(rmq[k - 1][i][j], rmq[k - 1][i + p][j]);
                int aux2 = max(rmq[k - 1][i][j + p], rmq[k - 1][i + p][j + p]);
                rmq[k][i][j] = max(aux1, aux2);
            }
        }
    }
    for(int i = 1; i <= q; i++)
    {
        int x, y, k;
        in >> x >> y >> k;
        out << query(x, y, k) << "\n";
    }
    return 0;
}