#include<stdio.h>
#include<algorithm>
#define maxn 505
#define maxlg 25
#define maxb 8192
using namespace std;

#define nxt if(++pos==maxb) fread(buff,1,maxb,stdin),pos=0
int n,m;
int a[maxn][maxn];
int rmq[maxn][maxn][maxlg],lg[maxn];
char buff[maxb];
int pos=0;

int get()
{
    int nr=0;
    while(buff[pos]<'0' || buff[pos]>'9') nxt;
    while(buff[pos]>='0' && buff[pos]<='9')
    {
        nr=nr*10+buff[pos]-'0';
        nxt;
    }
    return nr;
}

void read()
{
    n=get(); m=get();
    for(int i=1;i<=n;i++)
     for(int j=1;j<=n;j++)
      a[i][j]=get();
}

void RMQ()
{
    for(int i=1;i<=n;i++)
     for(int j=1;j<=n;j++)
      rmq[i][j][0]=a[i][j];

    for(int i=2;i<=n;i++) lg[i]=lg[i/2]+1;
    int cnt;
    for(int k=1;(1<<k)<=n;k++)
     for(int i=1;i+(1<<k)-1<=n;i++)
      for(int j=1;j+(1<<k)-1<=n;j++)
      {
          cnt=(1<<(k-1));
          rmq[i][j][k]=max(rmq[i][j][k-1],rmq[i][j+cnt][k-1]);
          rmq[i][j][k]=max(rmq[i][j][k],rmq[i+cnt][j][k-1]);
          rmq[i][j][k]=max(rmq[i][j][k],rmq[i+cnt][j+cnt][k-1]);
      }
}

int det(int x,int y,int k)
{
    int sol,cnt;
    int p=lg[k]; cnt=(1<<p);
    sol=max(rmq[x][y][p],rmq[x][y+k-cnt][p]);
    sol=max(sol,rmq[x+k-cnt][y][p]);
    sol=max(sol,rmq[x+k-cnt][y+k-cnt][p]);
    return sol;
}

void solve()
{
    int x,y,z;
    for(int i=1;i<=m;i++)
    {
        x=get(); y=get(); z=get();
        printf("%d\n",det(x,y,z));
    }
}

int main()
{
    freopen("plantatie.in","r",stdin);
    freopen("plantatie.out","w",stdout);

    read();
    RMQ();
    solve();

    fclose(stdin);
    fclose(stdout);
    return 0;
}