#include <cstdio>
#define MAX 500
#define LOG 10

inline int maxim(int a, int b)
{
    if(a>b)
        return a;
    return b;
}
int rmq[LOG][MAX+1][MAX+1], lg[MAX+1], n;
inline int formula(int i, int j, int log)
{
    int a, b, c, d;
    a=rmq[log-1][i][j];
    b=rmq[log-1][i+(1<<(log-1))][j+(1<<(log-1))];
    c=rmq[log-1][i+(1<<(log-1))][j];
    d=rmq[log-1][i][j+(1<<(log-1))];
    return maxim(maxim(a, b), maxim(c, d));
}
void calculate()
{
    for(int log=1;(1<<log)<=n;++log)
        for(int i=1;i+(1<<log)-1<=n;++i)
            for(int j=1;j+(1<<log)-1<=n;++j)
                rmq[log][i][j]=formula(i, j, log);
}
int main()
{
    freopen("plantatie.in", "r", stdin);
    freopen("plantatie.out", "w",stdout);
    int t, log, a, b, c, d, X, Y, x, y, k;
    scanf("%d%d", &n, &t);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            scanf("%d", &rmq[0][i][j]);
    lg[1]=0;
    for(int i=2;i<=n;++i)
        lg[i]=lg[i/2]+1;
    calculate();
    for(int w=1;w<=t;++w)
    {
        scanf("%d%d%d", &x, &y, &k);
        log=lg[k], X=x+k-1, Y=y+k-1;
        a=rmq[log][x][y];
        b=rmq[log][X-(1<<log)+1][Y-(1<<log)+1];
        c=rmq[log][X-(1<<log)+1][y];
        d=rmq[log][x][Y-(1<<log)+1];
        printf("%d\n", maxim(maxim(a, b), maxim(c, d)));
    }
    return 0;
}