#include<stdio.h>
#define input "plantatie.in"
#define output "plantatie.out"
int a[501][501][20],n,m,log[5001];
inline int max(int a, int b, int c, int d)
{
	if(a>=b&&a>=c&&a>=d) 
		return a;
	if(b>=a&&b>=c&&b>=d) 
		return b;
	if(c>=b&&c>=a&&c>=d) 
		return c;
	if(d>=b&&d>=c&&d>=a) 
		return d;
	return 0;
}
void open()
{
	freopen(input,"r",stdin);
	freopen(output,"w",stdout);
}
void read()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			scanf("%d",&a[i][j][0]);
}
void build()
{
	for(int k=1;(1<<k)<=n;k++)
		for(int i=1;i<=n-(1<<k)+1;i++)
			for(int j=1;j<=n-(1<<k)+1;j++)
				a[i][j][k]=max(a[i][j][k-1],a[i][j+(1<<(k-1))][k-1],a[i+(1<<(k-1))][j][k-1], a[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
	log[1]=0;
	for(int i=2;i<=n;i++)
		log[i]=log[i/2]+1;
}
void query()
{
	int x,y,z,p;
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&x,&y,&z);
		p=log[z];
		printf("%d\n",max(a[x][y][p],a[x][y+z-(1<<p)][p],a[x+z-(1<<p)][y][p],a[x+z-(1<<p)][y+z-(1<<p)][p]));
	}
}
int main()
{
	open();
	read();
	build();
	query();
	return 0;
}