#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");
int n,m;
int rmq[11][501][501],i,l,lg[501],j,k;
int main()
{
    in>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            in>>rmq[0][i][j];
    for(i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(k=1;(1<<k)<=n;k++)
        for(i=1;i<=n-(1<<k)+1;i++)
            for(j=1;j<=n-(1<<k)+1;j++)
            {
                l=1<<(k-1);
                int cmp[]={rmq[k-1][i][j],rmq[k-1][i+l][j],rmq[k-1][i][j+l],rmq[k-1][i+l][j+l]};
                rmq[k][i][j]=*max_element(cmp,cmp+4);
            }
    for(;m;m--)
    {
        in>>i>>j>>k;
        int nv=lg[k];
        l=(1<<nv);
        int cmp[]={rmq[nv][i][j],rmq[nv][i][j+k-l],rmq[nv][i+k-l][j],rmq[nv][i+k-l][j+k-l]};
        out<<*max_element(cmp,cmp+4)<<"\n";
    }





    return 0;
}