#include <fstream>

using namespace std;
ifstream fin ("plantatie.in");
ofstream fout ("plantatie.out");

int n, m, i1, j1, i2, j2, e, L;
int r[10][502][502], E[502];
int main()
{
   fin>>n>>m;
   for(int i=1; i<=n; i++)
    for(int j=1; j<=n; j++)
        fin>>r[0][i][j];
   for(int p=1; (1<<p)<=n; p++)
   {
       for(int i=1; i<=n-(1<<p)+1; i++)
       {
           for(int j=1; j<=n-(1<<p)+1; j++)
           {
                i1=i+(1<<(p-1));
                j1=j+(1<<(p-1));
                r[p][i][j]=max(max(r[p-1][i][j], r[p-1][i][j1]), max(r[p-1][i1][j], r[p-1][i1][j1]));
           }
       }
   }

    E[1]=0;
    for(int i=2; i<=n; i++)
        E[i]=E[i/2]+1;

    for(int i=1; i<=m; i++)
    {
        fin>>i1>>j1>>L;
        e=E[L];
        i2=i1+L-(1<<e);
        j2=j1+L-(1<<e);
        fout<<max(max(r[e][i1][j1],r[e][i2][j1] ), max(r[e][i1][j2], r[e][i2][j2]))<<"\n";
    }

    return 0;
}