//https://infoarena.ro/problema/plantatie4
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("fast-math")
//#pragma GCC optimize ("unroll-loops")
//#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
//#include <cmath>
//#include <bitset>
//#include <queue>
//#include <utility>
//#include <algorithm>
//#include <string>
//#include <map>
//#include <climits>
//#include <iomanip>
using namespace std;

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

int d[10][505][505];
int l[505];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, m, i, j;
	int x, y, k;

	fin >> n >> m;
	for (i = 1; i <= n; ++i)
	{
		for (j = 1; j <= n; ++j)
		{
			fin >> d[0][i][j];
			//cout << i << " " << j << " ";
			//cout << d[0][i][j] << " ";
		}
		//cout << "\n";
		if (i != 1)
		{
			l[i] = l[i >> 1] + 1;
		}
	}

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

	for (i = 1; i <= m; ++i)
	{
		fin >> x >> y >> k;

		int lg = l[k];
		fout << max(max(d[lg][x][y], d[lg][x + k - (1 << lg)][y]), max(d[lg][x][y + k - (1 << lg)], d[lg][x + k - (1 << lg)][y + k - (1 << lg)])) << "\n";
	}

	return 0;
}