#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int a[501][501][11],n,m,loga[501];

inline int maxim(int a, int b, int c, int d)
{
    int m=a;
    if(m<b)m=b;
    if(m<c)m=c;
    if(m<d)m=d;
    return m;
}

int main()
{
    fin>>n>>m;
    int i,j,k;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>a[i][j][0];

    for(i=2;i<=n;i++)loga[i]=loga[(i>>1)]+1;

    for(k=1;(1<<k)<=n;k++)
        for(i=1;i+(1<<k)-1<=n;i++)
            for(j=1;j+(1<<k)-1<=n;j++)
                a[i][j][k]=maxim(a[i][j][k-1],a[i+(1<<(k-1))][j][k-1],a[i][j+(1<<(k-1))][k-1],a[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);

    for(i=1;i<=m;i++)
    {
        int x,y,l,x2,y2;
        fin>>x>>y>>l;
        x2=x+l;
        y2=y+l;
        l=loga[l];
        fout<<maxim(a[x][y][l],a[x2-(1<<l)][y][l],a[x][y2-(1<<l)][l],a[x2-(1<<l)][y2-(1<<l)][l])<<'\n';
    }
    return 0;
}