#include <cstdio>

using namespace std;

#define NMAX 502
#define LOGNMAX 12
#define MAXIM(A, B) (((A)>(B))?(A):(B))

int N, M, m[NMAX][NMAX], rmq[NMAX][NMAX][LOGNMAX], p[NMAX];

int main()
{
	freopen("plantatie.in", "r", stdin);
	freopen("plantatie.out", "w", stdout);

	int i, j, k;
	int x, y, l, ind, rez;

	scanf("%d %d\n", &N, &M);
	for (i = 0; i < N; ++i)
		for (j = 0; j < N; ++j)
			scanf("%d ", &rmq[i][j][0]);

	for (i = 2; i < NMAX; ++i)
		p[i] = p[i >> 1] + 1;
	for (k = 1; (1 << k) <= N; ++k)
		for (i = 0; i < N - (1 << k) + 1; ++i)
			for (j = 0; j < N - (1 << k) + 1; ++j)
				rmq[i][j][k] = MAXIM(MAXIM(MAXIM(rmq[i][j][k - 1], rmq[i + (1 << (k-1))][j][k - 1]), 
					rmq[i][j + (1 << (k-1))][k - 1]), rmq[i + (1 << (k-1))][j + (1 << (k-1))][k - 1]);

	for (i = 0; i < M; ++i)
	{
		scanf("%d %d %d\n", &x, &y, &l);
		--x;
		--y;
		ind = p[l];	
		rez = MAXIM(MAXIM(MAXIM(rmq[x][y][ind], rmq[x + l - (1 << ind)][y][ind]), rmq[x][y + l - (1 << ind)][ind]),
			rmq[x + l - (1 << ind)][y + l - (1 << ind)][ind]);
		printf("%d\n", rez);
	}

	return 0;
}