#include <bits/stdc++.h>

using namespace std;
int n,m,rmq[505][505][15],lg[505],nr1,nr2,nr3;
void build_rmq () {
	for(int i=2;i<=n;++i)
		lg[i]=lg[(i>>1)]+1;
	for(int i=1;i<=lg[n];++i)
		for(int j=1;j+(1<<i)-1<=n;++j)
			for(int k=1;k+(1<<i)-1<=n;++k)
				rmq[j][k][i]=max(max(rmq[j][k][i-1],rmq[j+(1<<(i-1))][k][i-1]),max(rmq[j][k+(1<<(i-1))][i-1],rmq[j+(1<<(i-1))][k+(1<<(i-1))][i-1]));
}
int querrys (int i,int j,int lat) {
	return max(max(rmq[i][j][lg[lat]],rmq[i+lat-(1<<lg[lat])][j][lg[lat]]),max(rmq[i][j+lat-(1<<lg[lat])][lg[lat]],rmq[i+lat-(1<<lg[lat])][j+lat-(1<<lg[lat])][lg[lat]]));
}
int main () {
	freopen("plantatie.in","r",stdin);
	freopen("plantatie.out","w",stdout);
	scanf("%d%d", &n, &m);++m;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			scanf("%d", &rmq[i][j][0]);
	build_rmq();
	while(--m) {
		scanf("%d%d%d", &nr1, &nr2, &nr3);
		printf("%d \n", querrys(nr1,nr2,nr3));
	}
	return 0;
}