#include<fstream>
    #include<vector>
    #include<algorithm>
    //#include<iostream>
    using namespace std;

    ofstream cout("plantatie.out");
    class InParser {
        vector<char> str;
        int ptr;
        ifstream fin;

        char getChar() {
            if (ptr == int(str.size())) {
                fin.read(str.data(), str.size());
                ptr = 0;
            }
            return str[ptr++];
        }

        template<class T>
        T getInt() {
            char chr = getChar();
            while (!isdigit(chr) && chr != '-')
                chr = getChar();
            int sgn = +1;
            if (chr == '-') {
                sgn = -1;
                chr = getChar();
            }
            T num = 0;
            while (isdigit(chr)) {
                num = num * 10 + chr - '0';
                chr = getChar();
            }
            return sgn * num;
        }

    public:
        InParser(const char* name) : str(1e5), ptr(str.size()), fin(name) { }
        ~InParser() { fin.close(); }

        template<class T>
        friend InParser& operator>>(InParser& in, T& num) {
            num = in.getInt<T>();
            return in;
        }
    };
    InParser cin("plantatie.in");
   int a[18][1000][1000],E[1000],lat,p,i,j;
   int n,m;
   int main()
   {
      cin>>n>>m;
      for( i=1;i<=n;i++)
          for(j=1;j<=n;j++ )
              cin>>a[0][i][j];
      for(p=1;(1<<p)<=n;p++)
      {
          for(i=1;i<=n-(1<<p)+1;i++)
              for(j=1;j<=n-(1<<p)+1;j++)
              {
                  int i2=i+(1<<(p-1));
                  int j2=j+(1<<(p-1));
                  a[p][i][j]=max(max(a[p-1][i][j],a[p-1][i2][j]),
                                 max(a[p-1][i][j2],a[p-1][i2][j2]));

              }
      }
      for(i=2;i<=n;i++)
          E[i]=1+E[i/2];
      int x,y,l;
      for(;m;m--)
      {
          cin>>x>>y>>l;
          int e=E[l];
          int len=1<<e;
          int i2=x+l-len;
          int j2=y+l-len;
          cout<<max(
                  max(a[e][x][y],a[e][i2][y]),
                  max(a[e][x][j2],a[e][i2][j2])
                  )<<'\n';

      }

   }