#include <iostream>
#include <fstream>
#include <vector>

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

int n, m;
int rmq[18][501][501];
int lg[100001];
int vec[501][501];

int max(int a, int b, int c, int d)
{
    int maxim = a;
    if(maxim < b)
    {
        maxim = b;
    }
    if(maxim < c)
    {
        maxim = c;
    }
    if(maxim < d)
    {
        maxim = d;
    }
    return maxim;
}

void citire()
{
    int p;
    fin>>n>>m;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            fin>>vec[i][j];
            rmq[0][i][j] = vec[i][j];
        }
    }

    for(int i = 2; i <= n; i++)
    {
        lg[i] = lg[i / 2] + 1;
    }

    for(int i = 1; (1<<i) <= n; i++)
    {
        for(int j = 0; j < n - (1<<i) + 1; j++)
        {
            for(int u = 0; u < n - (1<<i) + 1; u++)
            {
                int l = 1<<(i-1);
                rmq[i][j][u] = max(rmq[i - 1][j][u], rmq[i - 1][j + l][u], rmq[i - 1][j + l][u + l], rmq[i - 1][j][u + l]);
            }
        }
    }

    int p1, p2, p3;
    for(int i = 0; i < m; i++)
    {
        fin>>p1>>p2>>p3;
        p1--;
        p2--;
        long long lung = (1<<lg[p3]);

        fout<<max(rmq[lg[p3]][p1][p2], rmq[lg[p3]][p1+p3-lung][p2], rmq[lg[p3]][p1+p3-lung][p2+p3-lung], rmq[lg[p3]][p1][p2+p3-lung])<<'\n';
    }

}

int main()
{
    citire();
    return 0;
}