#include<fstream>
using namespace std;
int n,m,a[505][505];

int main()
{
    ifstream in("plantatie.in");
    in>>n>>m;
    int i,j;
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            in>>a[i][j];
    
    int max,k,ii,jj,t,p,q,x;
    ofstream out("plantatie.out");
    for (t=1;t<=m;t++)
        {
             in>>i>>j>>k;
             max=a[i][j];
             ii=i+k-1;
             jj=j+k-1;
             for (p=i;p<=ii;p++)
                 for (q=j;q<=jj;q++)
                     if (a[p][q]>max)
                        max=a[p][q];
             out<<max<<"\n";
        }
    in.close();
    out.close();
    
    return 0;
}