#include<stdio.h>

#define nmax 256

int n,m[nmax][nmax][nmax];

int max(int x,int y)
{
    if (x>y)
        return x;
    return y;
}

int main()
{
    int t;
    freopen("plantatie.in","r",stdin);
    freopen("plantatie.out","w",stdout);
    scanf("%d%d",&n,&t);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            scanf("%d",&m[i][j][0]);
            
    for(int k=1;k<n;++k)
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                m[i][j][k]=max( max(m[i][j][k-1],m[i+1][j][k-1]) , max(m[i+1][j+1][k-1],m[i][j+1][k-1]) );
                
    for(;t;--t)
        {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        printf("%d\n",m[a][b][c-1]);
        }
    return 0;
}