#include <fstream>
using namespace std;
ifstream fin ("plantatie.in");
ofstream fout ("plantatie.out");
int N, M, x, y, h, dif, l, lg[510], V[510][510][12];

int main()
{
    fin >> N >> M;
    for (int i = 1; i <= N; i++)
    {
        for (int j = 1; j <= N; j++)
        {
            fin >> V[i][j][0];
        }
    }
    for (int j = 2; j <= N; j++)
    {
        lg[j] = lg[j / 2] + 1;
    }

    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++)
            {
                l = (1 << (k - 1));
                V[i][j][k] = max(V[i][j][k-1], max(V[i+l][j][k-1], max(V[i][j+l][k-1], V[i+l][j+l][k-1])));
            }
        }
    }

    for (int i = 1; i <= M; i++)
    {
        fin >> x >> y >> h;
        l = lg[h];
        int pl = h - (1 << l);
        fout << max(V[x][y][l], max(V[x][y+pl][l], max(V[x+pl][y][l], V[x+pl][y+pl][l]))) << '\n';
    }

    fout.close();
    return 0;
}