#include "bits/stdc++.h"
using namespace std;
ifstream f ("plantatie.in");
ofstream g ("plantatie.out");
int v[10][502][502],e[502];
int main ()
{
    int n,m,x,y,p,lat,i,j,l,i1,j1,k,len;
    f>>n>>m;
    for (x=1;x<=n;x++)
    {
        for (y=1;y<=n;y++)
        {
            f>>v[0][x][y];
        }
    }
    for (p=1;(1<<p)<=n;p++)
    {
        lat=1<<p;
        for (i=1;i<=n-lat+1;i++)
        {
            for (j=1;j<=n-lat+1;j++)
            {
                i1=i+lat/2;
                j1=j+lat/2;
                v[p][i][j]=max (max (v[p-1][i][j],v[p-1][i1][j]),max(v[p-1][i][j1],v[p-1][i1][j1]));
            }
        }
    }
    e[1]=0;
    for (x=2;x<=n;x++)
        e[x]=1+e[x/2];
    for (x=1;x<=m;x++)
    {
        f>>i>>j>>l;
        k=e[l];
        len=1<<k;
        i1=i+l-len;
        j1=j+l-len;
        g<<max(max(v[k][i][j],v[k][i][j1]),max (v[k][i1][j],v[k][i1][j1]))<<endl;
    }
    return 0;
}