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

ifstream is("plantatie.in");
ofstream os("plantatie.out");

int N, T, D[501][501][501];
int x,y,z;

int main()
{
    is >> N >> T;
    for ( int i = 1; i <= N; ++i )
        for ( int j = 1; j <= N; ++j )
            is >> D[i][j][1];

    for ( int k = 2; k <= N; ++k )
        for ( int i = 1; i <= N; ++i )
            for ( int j = 1; j <= N; ++j )
                D[i][j][k] = max(max(D[i][j][k-1],D[i+1][j][k-1]),max(D[i+1][j+1][k-1],D[i][j+1][k-1]));

    for ( int i = 1; i <= T; ++i )
    {
        is >> x >> y >> z;
        os << D[x][y][z] << '\n';
    }
    return 0;
}