#include <fstream>

using namespace std;

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

const int Nmax=502;
const int LOG=10;

int n,m,l,c,lat,l2,c2,L;
int v[Nmax][Nmax],r[Nmax][LOG][LOG],log[Nmax];

int maxim ( int x , int y ){
    return x > y ? x : y;
}

int maxim ( int x , int y , int z , int w ){
    return maxim( maxim(x,y) , maxim(z,w) );
}

int main()
{
    fin>>n>>m;


    for ( int i=1 ; i<=n ; i++ ){
        for ( int j=1 ; j<=n ; j++ )
            fin>>v[i][j];
    }


    for ( int i=2 ; i<=n ; i++ )
        log[i]=1+log[i/2];


    for ( int i=1 ; i<=n ; i++ ) {
        for ( int j=1 ; j<=n ; j++ ) {
            for ( int k=1 ; (1<<k)<=n ; k++ ) {
                    r[i][j][k]=maxim(r[i][j][k - 1], r[i][j-(1<<(k-1))][k-1], r[i-(1<<(k-1))][j][k-1], r[i-(1<<(k-1))][j-(1<<(k-1))][k-1]);
            }
        }
    }

    for ( int i=1 ; i<=m ; i++ ){
        fin>>l>>c>>lat;
        l+=lat-1;
        c+=lat-1;
        L=log[lat];
        fout<<maxim( r[l][c][L] , r[l][c-lat+(1<<L)][L] , r[l-c+(1<<L)][c][L] , r[l-lat+(1<<L)][c-lat+(1<<L)][L] )<<'\n';
    }

}