#include<fstream>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");

const int nmax = 506;
int n, m, d[nmax][nmax][10], x, y, l, lgsup[nmax];

int main(){
	int player_unu=0;

	in>>n>>m;
	for(int i = 1; i<=n; i++)
		for(int j = 1; j<=n; j++)
			in>>d[i][j][0];

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

	for(int i = 2; i<=n; i++)
		lgsup[i] = lgsup[i/2] + 1;

	for(int i = 0; i<m; i++)
	{
		in>>x>>y>>l;

		out<<max(max(d[x][y][lgsup[l]], d[x][y + l - (1<<lgsup[l])][lgsup[l]]), max(d[x + l - (1<<lgsup[l])][y][lgsup[l]], d[x + l - (1<<lgsup[l])][y + l - (1<<lgsup[l])][lgsup[l]]))<<'\n';
	}

	return player_unu;
}