#include <cstdio>
#define N 700

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

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][1]);

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

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


    return 0;
}