#include<cstdio>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f ("plantatie.in");
ofstream g ("plantatie.out");
int a[502][502][10];
int main()
{
    int n,m,i,j,x,y,k,p=1,maxk=0,l,sol;
    f>>n>>m;
    
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++) {
            int u;
            f>>u;
            a[i][j][0] = u;
            g<<a[i][j][0];
            //g<<a[i][j][0];
        }
    while(p<=n)
    {
        p*=2;
        maxk++;
    }
    maxk--;
    p=1;
    for(k=1;k<=maxk;k++)
    {
        for(i=1;i<=n-p*2+1;i++)
        for(j=1;j<=n-p*2+1;j++)
        {
            a[i][j][k]=max(a[i][j][k-1],max(a[i+p][j+p][k-1],max(a[i+p][j][k-1],a[i][j+p][k-1])));
        }
        p*=2;
    }
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>l;
        p=1;
        k=0;
        while(p<=l)
        {
            p*=2;
            k++;
        }
        k--;
        p/=2;
        sol=max(a[x][y][k],max(a[x+l-p][y+l-p][k],max(a[x][y+l-p][k],a[x+l-p][y][k])));
        g<<sol<<'\n';
    }
    return 0;
}