#include <cstdio>
#include <algorithm>
using namespace std;

#define Nmax 502
#define LogN 10

FILE *f = fopen ( "plantatie.in", "r" );
FILE *g = fopen ( "plantatie.out", "w" );

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;
}

int main(){

    int Q;

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

    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 )
            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 ) );
    }

    return 0;
}