#include <fstream>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int n, m, i, j, k;
int x, y, l;
int rmq[501][501][9];
int lg[501];
int main()
{
    f>>n>>m;
    for (i=1; i<=n; i++)
        for (j=1;j<=n;j++)
        {
            f>>x;
            rmq[i][j][0]=x;
        }
    for (k=1;(1 << k)<=n;k++)
        for (i=1; i+(1 << k)-1<=n;i++)
            for (j=1;j+(1 << k)-1<=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 (i=2;i<=n; i++)
        lg[i]=lg[i/2]+1;
    for (i=1;i<=m; i++)
    {
        f>>x>>y>>l;
        k=lg[l];
        g<<max(max(rmq[x][y][k],rmq[x+l-(1 << k)][y+l-(1 << k)][k]),max(rmq[x+l-(1 << k)][y][k],rmq[x][y+l-(1<< k)][k]))<< "\n";
    }
    return 0;
}