#include <fstream>
#include <vector>

using namespace std;

vector <vector <vector <int>>> rmq;
vector <int> log2;

void constructie_log2(int n)
{
    log2.resize(n + 1, 0);
    for (int i = 2; i <= n; i++)
    {
        log2[i] = 1 + log2[i/2];
    }
}

void constructie_rmq(int n)
{
    for (int e = 1; e <= log2[n]; e++)
    {
        rmq[e].resize(n + 1);
        for (int i = (1 << e); i <= n; i++)
        {
            rmq[e][i].resize(n + 1);
            for (int j = (1 << e); j <= n; j++)
            {
                int p = 1 << (e - 1);
                rmq[e][i][j] = max(max(rmq[e-1][i-p][j-p], rmq[e-1][i-p][j]),
                                   max(rmq[e-1][i][j-p], rmq[e-1][i][j]));
            }
        }
    }
}

int maxim(int lin, int col, int lat)
{
    int exp = log2[lat];
    int p = (1 << exp);
    return (max(max(rmq[exp][lin-lat+p][col-lat+p], rmq[exp][lin-lat+p][col]),
                max(rmq[exp][lin][col-lat+p], rmq[exp][lin][col])));
}

int main()
{
    ifstream in("plantatie.in");
    ofstream out("plantatie.out");
    int n, q;
    in >> n >> q;
    constructie_log2(n);
    rmq.resize(log2[n] + 1);
    for (int e = 0; e <= log2[n]; e++)
    {
        rmq[e].resize(n + 1);
    }
    for (int i = 1; i <= n; i++)
    {
        rmq[0][i].resize(n + 1);
        for (int j = 1; j <= n; j++)
        {
            in >> rmq[0][i][j];
        }
    }
    constructie_rmq(n);
    for (int i = 0; i < q; i++)
    {
        int lin, col, lat;
        in >> lin >> col >> lat;
        out << maxim(lin + lat - 1, col + lat - 1, lat) << "\n";
    }
    in.close();
    out.close();
    return 0;
}