#include <iostream>
#include <fstream>
using namespace std;

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

int st_plantation[501][501][10];
int plantation[501][501];
int log2_table[513];

void create_log(int n)
{
    log2_table[1] = 0;
    for (int i = 2; i <= n; ++i)
        log2_table[i] = log2_table[i / 2] + 1;
}

int main()
{
    int n, m;
    fin >> n >> m;

    create_log(512);

    for (int row = 1; row <= n; row++)
        for (int col = 1; col <= n; col++)
            fin >> plantation[row][col];

    for (int row = 1; row <= n; row++)
    {
        for (int col = 1; col <= n; col++)
            st_plantation[row][col][0] = plantation[row][col];

        for (int k = 1; (1 << k) <= n; k++)
            for (int col = 1; col + (1 << k) - 1 <= n; col++)
                st_plantation[row][col][k] = max(st_plantation[row][col][k - 1], st_plantation[row][col + (1 << (k - 1))][k - 1]);
    }

    for (int query = 0; query < m; query++)
    {
        int x, y, z;
        fin >> x >> y >> z;
        int k = log2_table[z];
        int max_val = 0;

        for (int i = x; i < x + z; ++i)
        {
            int left = st_plantation[i][y][k];
            int right = st_plantation[i][y + z - (1 << k)][k];
            max_val = max(max_val, max(left, right));
        }
        fout << max_val << "\n";
    }

    fin.close();
    fout.close();

    return 0;
}