#include <iostream>
#include <fstream>

using namespace std;

ifstream in ("plantatie.in");
ofstream out ("plantatie.out");

int log[502],r[9][506][506];

int max(int a, int b, int c, int d)
{

    return max(max(a,b), max(c,d));

}
int main()
{
    int p,q,k,n,m,x,y;
    in>>n>>m;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
        {
            in >> r[0][i][j];
        }
    log[1]=0;
    for (int i=2;i<=n;i++)
        log[i]=1+log[i/2];
    for (int l=1;l<=log[n];l++)
    {
        for (int i=1;i+(1<<l)<=n+1;i++)
            for (int j=1;j+(1<<l)<=n+1;j++)
            {
                /*r[l][i][j]=max(r[l-1][i][j],r[l-1][i][j+(1<<(l-1))]);
                r[l][i][j]=max(r[l][i][j],r[l-1][i+(1<<(l-1))][j]);
                r[l][i][j]=max(r[l][i][j],r[l-1][i+(1<<(l-1))][j+(1<<(l-1))]);*/
                r[l][i][j]=max(r[l-1][i][j],r[l-1][i][j+(1<<(l-1))],r[l-1][i+(1<<(l-1))][j],r[l-1][i+(1<<(l-1))][j+(1<<(l-1))]);
            }
    }

    for (int i=1;i<=m;i++)
    {
        in>>p>>q>>k; //k latura
        int p2=p+k-1; //lin
        int q2=q+k-1; //col
        int l=log[k];
        /*int maxx;
        maxx=max(r[l][p][q],r[l][p][q2-(1<<l)+1]);
        maxx=max(maxx,r[l][p2-(1<<l)+1][q]);
        maxx=max(maxx,r[l][p2-(1<<l)+1][q2-(1<<l)+1]);*/
        out<<max(r[l][p][q],r[l][p][q2-(1<<l)+1],r[l][p2-(1<<l)+1][q],r[l][p2-(1<<l)+1][q2-(1<<l)+1])<<'\n';
    }
    return 0;
}