#include <fstream>

using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int a[505][505][10],n,m,q,x,y,l,lg[505],sol,k;
void maxim()
{
    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++)
           {
               a[i][j][k]=max(a[i][j][k-1],a[i][j+(1<<(k-1))][k-1]);
               a[i][j][k]=max(a[i][j][k],a[i+(1<<(k-1))][j][k-1]);
               a[i][j][k]=max(a[i][j][k],a[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
           }
}
int main()
{
    fin>>n>>q;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
           fin>>a[i][j][0];
    maxim();
    lg[1]=0;
    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(int i=1;i<=q;i++)
    {
        fin>>x>>y>>l;
        k=lg[l];
        sol=0;
        sol=max(a[x][y][k],a[x+l-(1<<k)][y][k]);
        sol=max(sol,a[x][y+l-(1<<k)][k]);
        sol=max(sol,a[x+l-(1<<k)][y+l-(1<<k)][k]);
        fout<<sol<<"\n";
    }
    return 0;
}