#include <fstream>
#include <cmath>

using namespace std;

ifstream in("plantatie.in");
ofstream out("plantatie.out");
int n, q;
int v[505][505];
int rmq[11][505][505];

int max4(int a, int b, int c, int d)
{
    return max(max(a, b), max(c, d));
}

int query(int i1, int j1, int i2, int j2)
{
    int l = log2(i2 - i1 + 1);

    //out<<i1<<" "<<j1<<" "<<i2<<" "<<j2<<'\n';

    return max4(rmq[l][i1][j1], rmq[l][i2 - (1 << l) + 1][j1], rmq[l][j1][j2 - (1 << l) + 1], rmq[l][i2 - (1 << l) + 1][j2 - (1 << l) + 1]);
}

int main()
{
    in>>n>>q;

    for(int i = 1; i<=n; i++)
    {
        for(int j = 1; j<=n; j++)
        {
            in>>v[i][j];

            //out<<v[i][j]<<" ";
        }
        //out<<'\n';
    }

    for(int i = 1; i<=n; i++)
    {
        for(int j = 1; j<=n; j++)
        {
            rmq[0][i][j] = v[i][j];
        }
    }

    int lg = log2(n);

    for(int l = 1; l<=lg; l++)
    {
        for(int i = 1; i<=n - (1 << l) + 1; i++)
        {
            for(int j = 1; j<=n - (1 << l) + 1; j++)
            {
                rmq[l][i][j] = max4(rmq[l - 1][i][j], rmq[l - 1][i + (1 << (l - 1))][j], rmq[l - 1][i][j + (1 << (l - 1))], rmq[l - 1][i + (1 << (l - 1))][j + (1 << (l - 1))]);
            }
        }
    }

    int x, y, l;
    while(q--)
    {
        in>>x>>y>>l;

        out<<query(x, y, x + l - 1, y + l - 1)<<'\n';
    }

    return 0;
}