#include <fstream>
#include <algorithm>
#include <string>
using namespace std;

#define Nmax 502
#define LogN 10

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

int N, RMQ[LogN][Nmax][Nmax], Log2[Nmax];

void RMQ_pe_coloane(){

    for ( int col = 1; col <= N; ++col )
        for ( int lg = 1; ( 1<<lg ) <= N; ++lg )
            for ( int i = 1; i <= N -(1<<lg)+1; ++i )
                RMQ[lg][i][col] = max ( RMQ[lg-1][i][col], RMQ[lg-1][i+(1<<(lg-1))][col] );

}

int RMQ_pe_linii( int x, int y, int lat ){

    int k = Log2[lat];
    int t = lat - ( 1 << k );
    int Sol = -1;

    for ( int col = y; col < y+lat; ++col )
        Sol = max ( Sol, max ( RMQ[k][x][col], RMQ[k][x+t][col] ) );

    return Sol;
}

string Buffer;
string :: iterator it;

int ReadInt(){

    while ( *it < '0' || *it > '9' )
        it++;

    int nr = 0;

    while ( *it >= '0' && *it <= '9' ){
        nr = nr * 10 + ( *it-'0' );
        it++;
    }

    return nr;
}

int main(){

    int Q;

    getline ( fin, Buffer, char(0) );
    it = Buffer.begin();

    //fscanf ( f, "%d%d", &N, &Q );

    N = ReadInt();
    Q = ReadInt();

    for ( int i = 2; i <= N; ++i )
        Log2[i] = Log2[i>>1]+1;

    for ( int i = 1; i <= N; ++i )
        for ( int j = 1; j <= N; ++j )
            RMQ[0][i][j] = ReadInt();
            //fscanf ( f, "%d", &RMQ[0][i][j] );

    RMQ_pe_coloane();

    int x, y, z;
    while ( Q-- ){
        //fscanf ( f, "%d%d%d", &x, &y, &z );
        //fprintf ( g, "%d\n", RMQ_pe_linii( x, y, z ) );
        x = ReadInt();
        y = ReadInt();
        z = ReadInt();

        fout << RMQ_pe_linii( x, y, z ) << '\n';
    }

    return 0;
}