#include <bits/stdc++.h>

using namespace std;

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

int rmq[505][505][20], n, m, p2[505];

void RMQ()
{
    p2[1] = 0;
    for(int i = 2; i <= n; i++)
        p2[i] = 1 + p2[i/2];
    int pMax = p2[n];
    for(int k  = 1; k <= pMax; k++)
    {
        int p = p2[k];
        for(int i = 1; i + p <= n; i++)
            for(int j = 1; j + p <= n; j++)
                rmq[i][j][k] = max({rmq[i][j][k-1], rmq[i][j + p][k-1], rmq[i + p][j][k-1], rmq[i + p][j + p][k-1]});
    }
}

int main()
{
    int x, y, k;
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> rmq[i][j][0];
    RMQ();

    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y >> k;
        int p = p2[k-1];
        fout << max({rmq[x][y][p], rmq[x][y + k - p][p], rmq[x + k - p][y][p], rmq[x + k - p][y + k - p][p]}) << "\n";
    }
    return 0;
}