#include <stdio.h>

using namespace std;

const int N=501;
const int LOG=9;
int v[N][N];
int r[N][N][LOG];
int p2[N];

inline int max(int a, int b)
{
    if(a>b) return a;
    return b;
}

int main()
{
    FILE *in=fopen("plantatie.in","r");
    FILE *out=fopen("plantatie.out","w");
    int i,j,k,m,n,p,a,b,L,maxim;

    fscanf(in,"%d%d",&n,&m);

    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fscanf(in,"%d",&v[i][j]);

    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            r[i][j][0]=v[i][j];
            for(k=1;(1<<(k-1))<i && (1<<(k-1))<j;k++)
            {
                r[i][j][k]=max(r[i][j][k-1],r[i-(1<<(k-1))][j][k-1]);
                r[i][j][k]=max(r[i][j][k],r[i][j-(1<<(k-1))][k-1]);
                r[i][j][k]=max(r[i][j][k],r[i-(1<<(k-1))][j-(1<<(k-1))][k-1]);
            }
        }

    p2[1]=0;
    for(i=2;i<=n;i++)
    {
        p2[i]=p2[i-1];
        if((1<<(p2[i]+1))==i) p2[i]++;
    }

    for(i=1;i<=m;i++)
    {
        fscanf(in,"%d%d%d",&a,&b,&L);
        p=p2[L];
        maxim=max(r[a+L-1][b+L-1][p],r[a+(1<<p)-1][b+L-1][p]);
        maxim=max(maxim,r[a+L-1][b+(1<<p)-1][p]);
        maxim=max(maxim,r[a+(1<<p)-1][b+(1<<p)-1][p]);
        fprintf(out,"%d\n",maxim);
    }

    return 0;
}