# include <algorithm>
using namespace std;

# define DIM 501
# define LOG 10

int n, m, pow[ DIM ], sol[ DIM ][ DIM ][ LOG ];

inline int max ( int w, int x, int y, int z ) {

    if ( w > x && w > y && w > z )
        return w;

    if ( x > w && x > y && x > z )
        return x;

    if ( y > w && y > x && y > z )
        return y;

    return z;
}

void calc_sol () {

    int i, j, k;

    for ( k = 1; ( 1 << k ) <= n; ++ k )
        for ( i = 1; i + ( 1 << ( k - 1 ) ) <= n; ++ i )
            for ( j = 1; j + ( 1 << ( k - 1 ) ) <= n; ++ j )
                sol[ i ][ j ][ k ] = max ( sol[ i ][ j ][ k - 1 ], sol[ i ][ j + ( 1 << ( k - 1 ) ) ][ k - 1 ], sol[ i + ( 1 << ( k - 1 ) ) ][ j ][ k - 1 ], sol[ i + ( 1 << ( k - 1 ) ) ][ j + ( 1 << ( k - 1 ) ) ][ k - 1 ] );
}

void calc_pow () {

    int i, p;

    p = 0;
    for ( i = 1; i <= n; ++ i ) {

        if ( ( 1 << ( p + 1 ) ) == i )
            ++ p;
        pow[ i ] = p;
    }
}

void solve () {

    int i, j, k, d, p, x, y;

    scanf ( "%d%d", &n, &m );
    for ( i = 1; i <= n; ++ i )
        for ( j = 1; j <= n; ++ j )
            scanf ( "%d", &sol[ i ][ j ][ 0 ] );
    //calc_sol ();

    for (int k=1;(1<<k) <= n; ++k)
     for (int i=1;i<=n;++i) if (i+(1<<(k-1)) <= n)
     for (int j=1;j<=n;++j) if (j+(1<<(k-1)) <= n)
          sol[i][j][k] = max( sol[i][j][k-1] , sol[i+(1<<(k-1))][j+(1<<(k-1))][k-1] , sol[i+(1<<(k-1))][j][k-1] , sol[i][j+(1<<(k-1))][k-1] );

    calc_pow ();
    for ( i = 0; i < m; ++ i ) {

        scanf ( "%d%d%d", &x, &y, &k );
        p = pow[ k ];
        d = k - ( 1 << pow[ k ] );
        printf ( "%d\n", max ( sol[ x ][ y ][ p ], sol[ x ][ y + d ][ p ], sol[ x + d ][ y ][ p ], sol[ x + d ][ y + d ][ p ] ) );
    }
}

int main () {

    freopen ( "plantatie.in", "r", stdin );
    freopen ( "plantatie.out", "w", stdout );

    solve ();

    return 0;
}