#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int rmq[505][505][10], doi[505];
int main()
{
    int n,i,m,j,x,y,pk=2,k;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>rmq[i][j][0];

    for(k=1; pk<=n; k++,pk*=2) // iau pe rand puterile lui 2
        for(i=1; i<=n+1-pk; i++) // iau pe rand coltul din stanga sus (i, j)
            for(j=1; j<=n+1-pk; j++)
            {
                rmq[i][j][k] = max( max(rmq[i][j][k - 1], rmq[i][j+pk/2][k- 1]),
                                    max(rmq[i+pk/2][j][k-1], rmq[i+ pk/2][j+pk/2][k-1] )
                                   );
            }

    for(i=2;i<=n;i++)
        doi[i]=doi[i/2]+1;

    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>k;
        fout<<max( max(rmq[x][y][doi[k]], rmq[x][y+k-(1<<doi[k])][doi[k]]),
                   max(rmq[x+k-(1<<doi[k])][y][doi[k]], rmq[x+k-(1<<doi[k])][y+k-(1<<doi[k])][doi[k]])
                  )<<'\n';
    }
    return 0;


}