#include <bits/stdc++.h>
#define N 506
#define inf 1e9

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

int n, q;
int A[N][N];
int Log[N];
int R[N][N][26]; /// R[i][j][k] = max unui patrat de latura 2^k\
care sa inceapa in coltul (i, j)

void Precalculare()
{
    int i, j, k;
    for( i=2; i<=n; i++ )
        Log[i] = Log[i / 2] + 1;

    for( i=1; i<=n; i++ )
        for( j=1; j<=n; j++ )
            R[i][j][0] = A[i][j];

    for( k=1; k<=Log[n]; k++ )
        for( i=1; i + (1 << k) - 1 <= n; i++ )
            for( j=1; j + (1 << k) - 1 <= n; j++ )
                R[i][j][k] = std::max( {R[i][j][k - 1],
                                          R[i + (1 << (k - 1))][j][k - 1],
                                          R[i][j + (1 << (k - 1))][k - 1],
                                          R[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1]} );
}

void Citire()
{
    int i, j;
    fin >> n >> q;
    for( i=1; i<=n; i++ )
        for( j=1; j<=n; j++ )
            fin >> A[i][j];

    Precalculare();

}

void Rezolvare()
{
    int i, j, k;
    while( q-- )
    {
        fin >> i >> j >> k;
        int p = Log[k];
        int mx = std::max( {R[i][j][p],
                              R[i + k - (1 << p)][j][p],
                              R[i][j + k - (1 << p)][p],
                              R[i + k - (1 << p)][j + k - (1 << p)][p]} );
        fout << mx << "\n";
    }
}

int main()
{
    Citire();
    Rezolvare();
    return 0;
}