#include <iostream>
#include <fstream>

using namespace std;

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

const int dim = 505;

int n,m,rmq[dim][dim][10],dif,log2,st,dr,pu,rasp,mij,lg[dim],a[dim][dim];

int rezolva(int i,int j,int k)
{
    log2 = lg[k];
    return max(rmq[i][j][log2] , max(rmq[i][j+k-(1<<log2)][log2] , max(rmq[i+k-(1<<log2)][j][log2] , rmq[i+k-(1<<log2)][j+k-(1<<log2)][log2])));
}

int main()
{
    in >> n >> m;
    lg[1] = 0;
    for (int i=2; i<=n; i++)
    {
        lg[i] = 1 + lg[i/2];
    }
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            in >> a[i][j];
        }
    }
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            rmq[i][j][0] = a[i][j];
        }
    }
    for (int k=1; (1<<k) <=n; k++)
    {
        for (int i=1; i +(1<<k)-1 <= n; i++)
        {
            for (int j=1; j+(1<<k)-1<=n; j++)
            {
                rmq[i][j][k] = max(rmq[i][j][k-1] , max(rmq[i+(1<<(k-1))][j][k-1],max(rmq[i][j+(1<<(k-1))][k-1] , rmq[i+(1<<(k-1))][j+(1<<(k-1))][k-1])));
            }
        }
    }
    int x,y,k;
    while (m)
    {
        m--;
        in >> x >> y >> k;
        out << rezolva(x,y,k) << "\n";
    }
    return 0;
}