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

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++) fin>>x, a[i][j][0]=x;
    for(int k=1;k<=9;k++)
        for(int i=1;i+(1<<k)-1<=n;i++)
            for(int j=1;j+(1<<k)-1<=n;j++)
                a[i][j][k]=max(max(max(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(int i=2;i<=n;i++)
        log[i]=log[i/2]+1;

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