#include <fstream>
#include <math.h>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");

const int NMAX = 505;
const int LGMAX = 10;

long v[NMAX][NMAX][LGMAX];

int main()
{
    long n,m,i,j,k,x,y,z,l,c,ln;
    in >> n >> m;
    for (i = 1; i<=n; i++)
        for (j = 1; j<=n; j++)
            in >> v[i][j][0];
    for (k = 1; (1<<k)<=n; k++)
        for (i = 1; i+(1<<(k-1))<=n; i++)
            for (j = 1; j+(1<<(k-1))<=n; j++)
                v[i][j][k] = max(max(v[i][j][k-1],v[i+(1<<(k-1))][j][k-1]),max(v[i][j+(1<<(k-1))][k-1],v[i+(1<<(k-1))][j+(1<<(k-1))][k-1]));
    for (i = 1; i<=m; i++)
    {
        in >> x >> y >> z;
        l = z+x;
        c = z+y;
        ln = log2(z);
        out << max(max(v[x][y][ln],v[l-(1<<ln)][y][ln]),max(v[x][c-(1<<ln)][ln],v[l-(1<<ln)][c-(1<<ln)][ln])) << "\n";
    }
}