#include <fstream>

using namespace std;

ifstream f("plantatie.in");
ofstream g("plantatie.out");

int rmq[501][501][20],v[501][501],n,m,lg[501];

int main()
{
    f>>n>>m;

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

    for(int i=2;i<=n;++i){

        lg[i] = lg[i/2]+1;
        for(int j=1;j<=n;++j)
        {
            f>>v[i][j];
            rmq[i][j][0]=v[i][j];
        }
    }

    for(int k=1; (1<<k)<=n ; ++k)
        for(int i=1;i-1+(1<<k)<=n;++i)
            for(int j=1;j-1+(1<<k)<=n;++j)
        {

            rmq[i][j][k] = max(max(rmq[i][j][k-1],
                                   rmq[i+(1<<(k-1))][j+(1<<(k-1))][k-1]),max(
                                   rmq[i+(1<<(k-1))][j][k-1],
                                   rmq[i][j+(1<<(k-1))][k-1]));

        }
    for(int i=1;i<=m;++i)
    {

        int a,b,c;
        f>>a>>b>>c;

        int x=lg[c];

        g<<max(max(rmq[a][b][x],rmq[a+c-(1<<x)][b+c-(1<<x)][x]),max(rmq[a][b+c-(1<<x)][x],rmq[a+c-(1<<x)][b][x]))<<'\n';

    }

    return 0;
}