#include <iostream>
#include <fstream>
using namespace std;

class InParser
{
private:
    FILE *fin;
    char *buff;
    int sp;
    char read_ch()
    {
        ++sp;
        if (sp == 4096)
        {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }
public:
    InParser(const char* nume)
    {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }
    InParser& operator >> (int &n)
    {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-')
        {
            n = 0;
            sgn = -1;
        }
        else
        {
            n = c - '0';
        }
        while (isdigit(c = read_ch()))
        {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser
{
private:
    FILE *fout;
    char *buff;
    int sp;
    void write_ch(char ch)
    {
        if (sp == 50000)
        {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        }
        else
        {
            buff[sp++] = ch;
        }
    }
public:
    OutParser(const char* name)
    {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser()
    {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }
    OutParser& operator << (int vu32)
    {
        if (vu32 <= 9)
        {
            write_ch(vu32 + '0');
        }
        else
        {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }
    OutParser& operator << (char ch)
    {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch)
    {
        while (*ch)
        {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

InParser  f("plantatie.in");
OutParser g("plantatie.out");

const int LMAX = 10,
          NMAX = 501;

int N, M, l;
int rmq[NMAX][NMAX][LMAX], lg[NMAX];

int main()
{
    f >> N >> M;
    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= N; j++)
            f >> rmq[i][j][0];
    //
    lg[1] = 0;
    for(int i = 2; i <= N; i++)
        lg[i] = lg[i / 2] + 1;
    //
    for(int k = 1; (l = 1 << k) <= N; k ++)
        for(int i = 1; i <= N - l + 1; i ++)
            for(int j = 1; j <= N - l + 1; j ++)
                rmq[i][j][k] = max(max (rmq[i][j][k - 1], rmq[i][j + (l >> 1)][k - 1]), max (rmq[i + (l >> 1)][j][k - 1], rmq[i + (l >> 1)][j + (l >> 1)][k - 1]));
    //
    while(M--)
    {
        int i, j, k;
        f >> i >> j >> k;
        int p = 1 << lg[k];
        g << max(rmq[i][j][lg[k]], max(rmq[i + k - p][j][lg[k]], max(rmq[i][j + k - p][lg[k]], rmq[i + k - p][j + k - p][lg[k]]))) << '\n';
    }
    return 0;
}