#include <bits/stdc++.h>
#define pb push_back

using namespace std;

ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"

typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;

const int DMAX = 510;

class rmq{
    int n;
    int M[DMAX][10];

public:
    rmq(int n){
        this->n=n;
        return;
    }
    void constr(int V[DMAX]){
        int i,j;
        for(i=1;i<=n;i++)
            M[i][0]=V[i];
        for(j=1;(1<<j)<=n;j++)
            for(i=1;i+(1<<j)-1<=n;i++)
                M[i][j]=max(M[i][j-1],M[i+(1<<(j-1))][j-1]);
    }
    int query(int x,int y){
        int k=log2(y-x+1);
        return max(M[x][k],M[y-(1<<k)+1][k]);
    }
};

int M[DMAX][DMAX];

int n,q;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t,i,j;
    int x,y,k;

    fin>>n>>q;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>M[i][j];
    vector <rmq> vec(n+1,rmq(n));
    for(i=1;i<=n;i++)
        vec[i].constr(M[i]);
    while(q--){
        fin>>x>>y>>k;
        int maxim=0;
        for(i=1;i<=k;i++)
            maxim=max(maxim,vec[x+i-1].query(y,y+k-1));
        fout<<maxim<<'\n';
    }
    return 0;
}