#include <iostream>
#include <fstream>
#define lim 501
using namespace std;

ifstream f("plantatie.in");
ofstream g("plantatie.out");

int n, m, rmq[lim][lim][20], Lg[lim];

void preprocess()
{
    for(int i = 2; i <= n; ++i)
        Lg[i] = Lg[i>>1] + 1;
    for(int k = 1; (1<<k) <= n; ++k)
        for(int i = 1; i+(1<<k)-1 <= n; ++i)
            for(int j = 1; j+(1<<k)-1 <= n; ++j)
    {
        int f1, f2, f3, f4;
        f1 = rmq[i][j][k-1];
        f2 = rmq[i][j+(1<<(k-1))][k-1];
        f3 = rmq[i+(1<<(k-1))][j][k-1];
        f4 = rmq[i+(1<<(k-1))][j+(1<<(k-1))][k-1];
        rmq[i][j][k] = max(max(f1, f2), max(f3, f4));
    }
}

int main()
{
    f >> n >> m;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            f >> rmq[i][j][0];
    preprocess();
    for(int i = 1; i <= m; ++i)
    {
        int x, y, z, lg, sol1, sol2, sol3, sol4;
        f >> x >> y >> z;
        lg = Lg[z-1];
        sol1 = rmq[x][y][lg];
        sol2 = rmq[x][y+z-(1<<lg)][lg];
        sol3 = rmq[x+z-(1<<lg)][y][lg];
        sol4 = rmq[x+z-(1<<lg)][y+z-(1<<lg)][lg];
        g << max(max(sol1, sol2), max(sol3, sol4)) << "\n";
    }
}