#include <cstdio>
#define N 501

int A[N][N][10],n,m,i,j,k,logn,x,y,z;

inline int max(int x, int y)
{
    return (x>y?x:y);
}

int main()
{
	freopen("plantatie.in","r",stdin);
	freopen("plantatie.out","w",stdout);
	scanf("%d%d\n",&n,&m);
	for (i=1; i<=n; i++)
        for (j=1; j<=n; j++) scanf("%d",&A[i][j][0]);
    for (i=1; i<=n; i<<=1) logn++;
    logn--;

    for (k=1; k<=logn; k++)
        for (i=1; i<=n-(1<<k)+1; i++)
            for (j=1; j<=n-(1<<k)+1; j++)
                A[i][j][k]=max(max(A[i][j][k-1],A[i+(1<<(k-1))][j][k-1]),max(A[i][j+(1<<(k-1))][k-1],A[i+(1<<(k-1))][j+(1<<(k-1))][k-1]));

    for (i=1; i<=m; i++)
    {
        scanf("%d%d%d\n",&x,&y,&z);
        logn=0;
        for (k=1; k<=z; k<<=1) logn++;
        logn--;
        printf("%d\n",max(max(A[x][y][logn],A[x+z-(1<<logn)][y][logn]),max(A[x][y+z-(1<<logn)][logn],A[x+z-(1<<logn)][y+z-(1<<logn)][logn])));
    }

    return 0;
}