#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("plantatie.in");
ofstream fout ("plantatie.out");
const int N_MAX = 5e2 + 5;
const int LOG = 11;
int a[N_MAX][N_MAX],rmq[N_MAX][N_MAX][LOG],lg[N_MAX];
int n,q;
void solve() {
    for (int i=2; i<=n; i++){
        lg[i] = lg[i/2] + 1;
    }
    for (int i=1; i<=n; i++){
        for (int j=1; j<=n; j++){
            rmq[i][j][0] = a[i][j];
        }
    }
    for (int k=1; k<LOG; k++){
        for (int i=1; i+(1 << k)-1<=n; i++){
            for (int j=1; j+(1 << k)-1<=n; j++){
                rmq[i][j][k] = max({rmq[i][j][k - 1] , rmq[i + (1 << (k - 1))][j][k - 1] , rmq[i][j + (1 << (k - 1))][k - 1] , rmq[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1]});
            }
        }
    }
}
int query (int x , int y , int z){
    int k = lg[z] , ans = 0 , l = x + z - 1 , r = y + z - 1;
    ans = rmq[x][y][k];
    ans = max(ans , rmq[l - (1 << k) + 1][y][k]);
    ans = max(ans , rmq[x][r - (1 << k) + 1][k]);
    ans = max(ans , rmq[l - (1 << k) + 1][r - (1 << k) + 1][k]);
    return ans;
}
int main(){
    ios_base::sync_with_stdio(false);
    fin >> n >> q;
    for (int i=1; i<=n; i++){
        for (int j=1; j<=n; j++){
            fin >> a[i][j];
        }
    }
    solve();
    while (q--){
        int x,y,z;
        fin>>x>>y>>z;
        fout<<query(x,y,z)<<'\n';
    }
    return 0;
}