#include <iostream>
#include <iostream>
#include <vector>
#define NMAX 510
using namespace std;

const int maxLog = 10;
vector<char> lg;
int RMQ[NMAX][NMAX][maxLog], N, M;

void Read();
void RangeMinimumQuery();
void Solve();

int main()
{
    Read();
    RangeMinimumQuery();
    Solve();
    return 0;
}
void Solve()
{
    int i, j, k, sol;
    while(M--)
    {
        scanf("%d%d%d", &i, &j, &k);
        sol = max( RMQ[i][j][ lg[k] ], RMQ[i + k - (1<<lg[k])][j + k - (1<<lg[k])][ lg[k] ] );
        sol = max( sol, RMQ[i][j + k - (1<<lg[k])][ lg[k] ] );
        sol = max( sol, RMQ[i + k - (1<<lg[k])][j][ lg[k] ] );
        cout<<sol<<'\n';
    }
}
void RangeMinimumQuery()
{
    for(int k=1; (1<<k) <= N; ++k)
        for(int i=1; i + (1<<k) - 1 <= N; ++i)
            for(int j=1; j + (1<<k) -1 <= N; ++j)  {
                RMQ[i][j][k] = max( RMQ[i][j][k-1],  RMQ[i + (1<<(k-1) )][j][k-1] );
                RMQ[i][j][k] = max( RMQ[i][j][k],    RMQ[i][j + (1<<(k-1) )][k-1] );
                RMQ[i][j][k] = max( RMQ[i][j][k],    RMQ[i + (1<<(k-1) )][j + (1<<(k-1) )][k-1] );
            }
}
void Read()
{
    freopen("plantatie.in", "rt", stdin);
    freopen("plantatie.out", "wt", stdout);
    scanf("%d%d", &N, &M);
    for(int i=1; i<=N; ++i)
        for(int j=1; j<=N; ++j)
            scanf("%d", &RMQ[i][j][0]);
    lg.assign(2, 0);
    for(int i=2; i<=N; ++i)
        lg.push_back(lg[ i>>1 ] + 1);
}