#include<cstdio>
#include<algorithm>

using namespace std;

int a[500][500][10];
int n,m,i,j,k,l;

int main()
{

    freopen("plantatie.in","r",stdin);
    freopen("plantatie.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
            scanf("%d",&a[i][j][0]);

    for(i=1;(1<<i)<=n;i++)
    {
        for(j=0;j<=n-(1<<i);j++)
        {
            for(k=0;k<=n-(1<<i);k++)
            {
                a[j][k][i]=max(max(a[j][k][i-1],a[j+(1<<(i-1))][k][i-1]),
                max(a[j][k+(1<<(i-1))][i-1],a[j+(1<<(i-1))][k+(1<<(i-1))][i-1]));
            }
        }
    }
    for(;m;m--)
    {
        scanf("%d%d%d",&i,&j,&k);
        i--;j--;
        for(l=30;(1<<l)>k;l--);
        int rez=max(max(a[i][j][l],a[i+k-(1<<l)][j][l]),
                max(a[i][j+k-(1<<l)][l],a[i+k-(1<<l)][j+k-(1<<l)][l]));
        printf("%d\n",rez);
    }
return 0;
}