#include <fstream>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <cstring>
#include<algorithm>

using namespace std;


int n, q;
const int LOGMAX = 20;
int lg[503];
int mat[503][503][LOGMAX];

ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

void afis(int m[503][503][LOGMAX], int k)
{
	fout << "Sunt la nivelul: " << k << endl;
	for (int i = 1; i + (1 << k) - 1 <= n; i++)
	{
		for (int j = 1; j + (1 << k) - 1 <= n; j++)
		{
			fout << m[i][j][k] << " ";
		}
		fout << endl;

	}
}

void calc()
{
	for (int k = 1; (1 << k) <= n; k++)
	{
		for (int i = 1; i + (1 << k) - 1 <= n; i++)
		{
			//secventa de la i la i+1<<j are minimul
			//egal cu minimul de la i si secv 1<<(j-1) si i+1<<(j-1)
			//concret pt indicele 4 luat de secv 2 avem minimul de la 4 si minimul de la 4+1 ambele luate de lungime 1 
			for (int j = 1; j + (1 << k) - 1 <= n; j++)
			{
              mat[i][j][k] = max(mat[i][j][k - 1], mat[i + (1 << (k - 1))][j][k - 1]);
			  mat[i][j][k] = max(mat[i][j][k], mat[i][j + (1 << (k - 1))][k - 1]);
			  mat[i][j][k] = max(mat[i][j][k], mat[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1]);
			}
			
		}
		//afis(mat, k);
	}
}

int query(int lin, int col,int lung)
{
	//calculez cea mai mare putere de 2 care incape in lung; O(log(lung))
	//sau imi precalculez puterile cu un vector
	int k = lg[lung];
	int nr = 1 << (k);

	int maxim = max(mat[lin][col][k], mat[lin +lung-nr][col][k]);
	maxim = max(maxim, mat[lin][col + lung-nr][k]);
	maxim = max(maxim, mat[lin + lung-nr][col + lung-nr][k]);
	return maxim;

}



int main()
{
	fin >> n>>q;
	lg[1] = 0;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
            fin >> mat[i][j][0];
		}
		
		if (i >= 2)
		{
			lg[i] = lg[i / 2] + 1;
		}


	}


	calc();
	for (int i = 1; i <= q; i++)
	{
		int x, y,dist;
		fin >> x >> y>>dist;
		fout << query(x, y,dist)<<"\n";
	}
	return 0;
}