#include <bits/stdc++.h>

using namespace std;

using ll = long long;
const int INF=1e9+7;
const ll INFF=1e18+7;
#define nl '\n'
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char* x) { cout << '\"' << x << '\"'; }
void __print(const string& x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template<typename T, typename V>
void __print(const pair<T, V>& x) { cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}'; }
template<typename T>
void __print(const T& x) { int f = 0; cout << '{'; for (auto& i : x) cout << (f++ ? "," : ""), __print(i); cout << "}"; }
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cout << ", "; _print(v...); }
#ifndef ONLINE_JUDGE
#define debug(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

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

void solve()
{
    int n,q;
    fin>>n>>q;
    vector<vector<vector<int>>> a(n,vector<vector<int>>(n,vector<int>(int(log2(n)))));
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            fin>>a[i][j][0];
        }
    }
    for(int d=1; d<=log2(n); d++){
        for(int i=0; i+(1<<d)-1<n; i++){
            for(int j=0; j+(1<<d)-1<n; j++){
                a[i][j][d]=max(max(a[i][j][d-1],a[i+(1<<(d-1))][j+(1<<(d-1))][d-1]),
                               max(a[i+(1<<(d-1))][j][d-1],a[i][j+(1<<(d-1))][d-1]));
            }
        }
    }
    for(int i=0; i<q; i++){
        int x,y,k;
        fin>>x>>y>>k;
        x--,y--;
        int logg=log2(k);
        fout<<max(max(a[x][y][logg],a[x+k-(1<<logg)][y+k-(1<<logg)][logg]),
              max(a[x+k-(1<<logg)][y][logg],a[x][y+k-(1<<logg)][logg]))<<nl;
    }
}

int main()
{
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    // int t;
    // cin >> t;
    for(int tt=1; tt<=t; tt++){
        // cout<<"#Case "<<t<<nl;
        solve();
    }
    return 0;
}