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

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

int n,m;
int x[10][501][501];
inline int LAST(int x)
{
    return x&-x;
}
int putere2(int x)
{
    int nr;
    for(nr=0;x>>=1;nr++);
    return nr;
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            f>>x[0][i][j];
    for(int k=1;k<10;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                x[k][i][j]=max(max(x[k-1][i][j],
                                   x[k-1][i][j+(1<<(k-1))]),
                               max(x[k-1][i+(1<<(k-1))][j],
                                   x[k-1][i+(1<<(k-1))][j+(1<<(k-1))]));
    int i,j,k,p;
    for(int t=1;t<=m;t++)
    {
        f>>i>>j>>k;
        p=putere2(k);
        g<<max(max(x[p][i][j],
                   x[p][i][j+k-(1<<p)]),
               max(x[p][i+k-(1<<p)][j],
                   x[p][i+k-(1<<p)][j+k-(1<<p)]))<<'\n';
    }
    f.close();
    g.close();
    return 0;
}