#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
long long n,m,i,j,k,d[505][505][10],p,xx,yy,x,y,l;
int main()
{
    f>>n>>m;
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            f>>d[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++)
                d[i][j][k]=max(max(d[i][j][k-1],d[i][j+(1<<(k-1))][k-1]),max(d[i+(1<<(k-1))][j][k-1],d[i+(1<<(k-1))][j+(1<<(k-1))][k-1]));
     for (i=1;i<=m;i++)
    {
        f>>x>>y>>l;
        p=log2(l);
        xx=x+l-1;
        yy=y+l-1;
        g<<max(max(d[x][y][p],d[xx-(1<<p)+1][yy-(1<<p)+1][p]),max(d[xx-(1<<p)+1][y][p],d[x][yy-(1<<p)+1][p]))<<'\n';
    }
    return 0;
}