#include <fstream>
#include <algorithm>

using namespace std;

const int DIM = 510;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n, m;
int rmq[DIM][DIM][10];
int lg[DIM];

int main()
{
	fin >> n >> m;
	lg[1] = 0;
	for (int i = 1;i <= n;++i)
	{
		for (int j = 1;j <= n;++j)
			fin >> rmq[i][j][0];
		if (i != 1)
			lg[i] = lg[i >> 1] + 1;
	}
	for (int p = 1;(1 << p) <= n;++p)
		for (int i = 1;i + (1 << p) - 1 <= n;++i)
			for (int j = 1;j + (1 << p) - 1 <= n;++j)
				rmq[i][j][p] = max(max(rmq[i][j][p - 1], rmq[i][j + (1 << (p - 1))][p - 1]), max(rmq[i + (1 << (p - 1))][j][p - 1], rmq[i + (1 << (p - 1))][j + (1 << (p - 1))][p - 1]));
	int x, y, k, p;
	for (int i = 1;i <= m;++i)
	{
		fin >> x >> y >> k;
		p = lg[k];
		fout << max(max(rmq[x][y][p], rmq[x][y + k - (1 << p)][p]), max(rmq[x + k - (1 << p)][y][p], rmq[x + k - (1 << p)][y + k - (1 << p)][p])) << "\n";
	}
	fin.close();
	fout.close();
	return 0;
}