#include <fstream>

using namespace std;

#define NMAX 500
#define LOGNMAX 10
#define MAXIM(A, B) (((A)>(B))?(A):(B))

long N, M, m[NMAX][NMAX], rmq[NMAX][NMAX][LOGNMAX], p[NMAX];
ifstream in("plantatie.in");
ofstream out("plantatie.out");

void read()
{
	in >> N >> M;
	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j)
			in >> rmq[i][j][0];
}

void calc()
{
	for (int i = 2; i < NMAX; ++i)
		p[i] = p[i >> 1] + 1;
	for (int k = 1; (1 << k) <= N; ++k)
		for (int i = 0; i < N - (1 << k) + 1; ++i)
			for (int 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]);
}

void query()
{
	for (int i = 0; i < M; ++i)
	{
		int x, y, l, ind, rez;
		in >> 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]);
		out << rez << endl;
	}
}

int main()
{
	read();
	calc();
	query();

	in.close();
	out.close();

	return 0;
}