#include <bits/stdc++.h>
#define maxN 505
#define maxLog 13
using namespace std;
int rmq[maxN][maxN][maxLog];
int lg[maxN];
int n, m, i, j, k, p, sh, a, b, x, y;
class InputReader
{
public:
    InputReader() {}
    InputReader(const char *file_name)
    {
        input_file = fopen(file_name, "r");
        cursor = 0;
        fread(buffer, SIZE, 1, input_file);
    }
    inline InputReader &operator >>(int &n)
    {
        while(buffer[cursor] < '0' || buffer[cursor] > '9')
        {
            advance();
        }
        n = 0;
        while('0' <= buffer[cursor] && buffer[cursor] <= '9')
        {
            n = n * 10 + buffer[cursor] - '0';
            advance();
        }
        return *this;
    }
private:
    FILE *input_file;
    static const int SIZE = 1 << 17;
    int cursor;
    char buffer[SIZE];
    inline void advance()
    {
        ++ cursor;
        if(cursor == SIZE)
        {
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
    }
};
int maxim(int a,int b,int c,int d)
{
    return max(max(a,b),max(c,d));
}
int main()
{
    InputReader f("plantatie.in");
    freopen("plantatie.out","w",stdout);
    f>>n>>m;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
        f>>rmq[i][j][0];
    lg[1]=0;
    for(i=2; i<=n; i++)
        lg[i]=1+lg[i/2];
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            for(k=1; (1<<k)<=i && (1<<k)<=j; k++)
            {
                p=(1<<(k-1));
                rmq[i][j][k]=maxim(rmq[i][j][k-1],rmq[i-p][j][k-1],rmq[i][j-p][k-1],rmq[i-p][j-p][k-1]);
            }
    for(i=1; i<=m; i++)
    {
        f>>a>>b>>k;
        p=lg[k];
        x=a+k-1;
        y=b+k-1;
        sh=(1<<p);
        j=maxim(rmq[x][y][p],rmq[x][b-1+sh][p],rmq[a-1+sh][y][p],rmq[a-1+sh][b-1+sh][p]);
        printf("%d\n",j);
    }
    return 0;
}