#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");
const int NMAX=505;
int a[NMAX][NMAX];
int RMQ[20][NMAX][NMAX]; // maximul unei matrici de lungime 2^i;
int lg2[20];
int x,y,l;
int query()
{
    int x2=x+l-1;
    int y2=y+l-1;
    int lg=lg2[x2-x+1];
    return max(max({RMQ[lg][x][y], RMQ[lg][x2-(1<<lg)+1][y], RMQ[lg][x][y2-(1<<lg)+1]}), RMQ[lg][x2-(1<<lg)+1][y2-(1<<lg)+1]);
}
int main()
{
    int n,m;
    in>>n>>m;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
    {
        in>>a[i][j];
        RMQ[0][i][j]=a[i][j];
    }
    lg2[1]=0;
    for(int i=2; i<15; i++)
        lg2[i]=lg2[i/2]+1;
    for(int k=1; k<=lg2[n]; k++)
    {
        for(int i=1,ii;(ii=i+(1<<(k-1)))<=n; i++ )
        {
            for(int j=1,jj;(jj=j+(1<<(k-1)))<=n; j++)
            {
                RMQ[k][i][j]=max({RMQ[k-1][i][j], RMQ[k-1][i+(1<<(k-1))][j], RMQ[k-1][i][j+(1<<(k-1))], RMQ[k-1][i+(1<<(k-1))][j+(1<<(k-1))]});
            }
        }
    }

    for(int i=1; i<=m; i++)
    {
        in>>x>>y>>l;
        out<<query()<<"\n";
    }
    return 0;
}