#include <fstream>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

using namespace std;

ifstream f("plantatie.in");
ofstream g("plantatie.out");

int n, m, x, y, k, lg[505], a[10][505][505];

void RMQ()
{
    for (int i = 1; i <= n; ++i) {
        lg[i] = lg[i >> 1] + 1;
    }

    for (int k = 1; k <= lg[n]; ++k) {
        int dr = (1 << (k - 1));

        for (int i = 1; i <= n - dr; ++i) {
            for (int j = 1; j <= n - dr; ++j) {
                a[k][i][j] = max ( max(a[k - 1][i][j], a[k - 1][i + dr][j]), max (a[k - 1][i][j + dr], a[k - 1][i + dr][j + dr]) );
            }
        }
    }
}

int main()
{
    f >> n >> m;

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            f >> a[0][i][j];
        }
    }

    RMQ();

    while (m--) {
        f >> x >> y >> k;

        int dr = (1 << (lg[k] - 1)), kk = lg[k] - 1;

        g << max( max(a[kk][x][y], a[kk][x + k - dr][y]), max(a[kk][x][y + k - dr], a[kk][x + k - dr][y + k - dr]) ) << '\n';
    }

    return 0;
}