#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("plantatie.in");
ofstream g ("plantatie.out");
int rmq[504][504][504];
int log[1000];
//[i][j][lat]
int n;
int q;
int mak[504][504];
int main()
{
    f>>n>>q;
    for(int i=2; i<=n; i*=2) log[i]++;
    for(int i=1; i<=n; i++) log[i]+=log[i-1];
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=n;++j)
        {
           f>>mak[i][j];
           rmq[i][j][0]=mak[i][j];
        }
    }
    for(int h=1;(1<<h)<=n;++h)
    {
        for(int i=1;i<=n-(1<<h)+1;++i)
        {
            for(int j=1;j<=n-(1<<h)+1;++j)
            {
                rmq[i][j][h]=max(rmq[i][j+(1<<(h-1))][(h-1)],max(  rmq[i+(1<<(h-1))][j][(h-1)], max(rmq[i+(1<<(h-1))][j+(1<<(h-1))][(h-1)], rmq[i][j][h-1]) ));
            }
        }
    }
    for(int i=1;i<=q;++i)
    {
        int x,y,k;
        f>>x>>y>>k;
        int h=log[k];
      //  cout<<log[k]<<" "<<k<<"\n";
               g<<max(rmq[x][y][h], max( rmq[x-(1<<h)+k][y][h],max( rmq[x][y-(1<<h)+k][h], rmq[x-(1<<h)+k][y-(1<<h)+k][h]) ))<<"\n";
    }
    return 0;
}