#include <bits/stdc++.h>

using namespace std;

const int K = 10, N = 501;

int rmq[K][N][N]; // [k][i][j] [i, i+2**k)
int n, q, x, y, l;
int lg[N];

int main() {
	freopen("plantatie.in", "r", stdin);
	freopen("plantatie.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);

	for (int i = 2; i < N; ++i) lg[i] = lg[i / 2] + 1;

	cin >> n >> q;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			cin >> rmq[0][i][j];
		}
	}

	for (int p = 1; p < K; ++p) {
		for (int i = 1; i <= n - (1 << p) + 1; ++i) {
			for (int j = 1; j <= n - (1 << p) + 1; ++j) {
				rmq[p][i][j] = max(rmq[p - 1][i][j], rmq[p - 1][i + (1 << (p - 1))][j + (1 << (p - 1))]);
			}
		}
	}

	while (q--) {
		cin >> x >> y >> l;
		int sz = lg[l];

		cout << max(rmq[sz][x][y], rmq[sz][x + l - (1 << sz)][y + l - (1 << sz)]) << '\n';
	}

	return 0;
}