#include <bits/stdc++.h>
#define maxN 505
#define maxLog 13
using namespace std;
int rmq[maxN][maxN][maxLog];
int lg[maxN];
int n, m, i, j, k, p, sh, a, b, x, y;
int maxim(int a,int b,int c,int d)
{
    return max(max(a,b),max(b,c));
}
int main()
{
    freopen("plantatie.in","r",stdin);
    freopen("plantatie.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
        scanf("%d ",&rmq[i][j][0]);
    lg[1]=0;
    for(i=2; i<=n; i++)
        lg[i]=1+lg[i/2];
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            for(k=1; (1<<k)<=i && (1<<k)<=j; k++)
            {
                p=(1<<(k-1));
                rmq[i][j][k]=maxim(rmq[i][j][k-1],rmq[i-p][j][k-1],rmq[i][j-p][k-1],rmq[i-p][j-p][k-1]);
            }
    for(i=1; i<=m; i++)
    {
        scanf("%d %d %d",&a,&b,&k);
        p=lg[k];
        x=a+k-1;
        y=b+k-1;
        sh=(1<<p);
        printf("%d\n",maxim(rmq[x][y][p],rmq[x][b-1+sh][p],rmq[a-1+sh][y][p],rmq[a-1+sh][b-a+sh][p]));
    }
    return 0;
}