#include <fstream>
#include <math.h>

using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n, m, i, j, rmq[32][505][505], l, p, len;
int main()
{
    fin>>n>>m;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
        fin>>rmq[0][i][j];
    l=2;
    while(l<=n)
    {
        p++;
        for(i=1; i<=n-l+1; i++)
            for(j=1; j<=n-l+1; j++)
              rmq[p][i][j]=max(rmq[p-1][i][j], max(rmq[p-1][i+(1<<(p-1))][j], max(rmq[p-1][i][j+(1<<(p-1))], rmq[p-1][i+(1<<(p-1))][j+(1<<(p-1))])));
        l*=2;
    }
    while(m--)
    {
        fin>>i>>j>>l;
        p=log2(l);
        len=(1<<p);
        fout<<max(rmq[p][i][j], max(rmq[p][i+l-len][j], max(rmq[p][i][j+l-len], rmq[p][i+l-len][j+l-len])))<<'\n';
    }
    return 0;
}