//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;
constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;
random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());
template<typename T>
bool assign_max(T& a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template<typename T>
bool assign_min(T& a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template<typename T>
T square(T a) {
return a * a;
}
template<>
struct std::hash<pair<ll, ll>> {
ll operator() (pair<ll, ll> p) const {
return ((__int128)p.first * MOD + p.second) % INF64;
}
};
struct sparce_table {
vector<vector<pair<ll, ll>>> arr;
vector<ll> lg;
sparce_table(vector<ll> a) {
lg.push_back(0);
while (lg.size() <= a.size()) {
lg.push_back(lg.back());
if ((1 << (lg.back() + 1)) == lg.size() - 1) {
lg.back()++;
}
}
arr.resize(lg.back() + 1, vector<pair<ll, ll>>(a.size()));
for (ll i = 0; i < a.size(); i++) {
arr[0][i] = make_pair(a[i], i);
}
for (ll i = 1; i <= lg.back(); i++) {
for (ll j = 0; j + (1 << (i - 1)) < a.size(); j++) {
arr[i][j] = max(arr[i - 1][j], arr[i - 1][j + (1 << (i - 1))]);
}
}
}
pair<ll, ll> get(ll l, ll r) {
return max(arr[lg[r - l]][l], arr[lg[r - l]][r - (1 << lg[r - l])]);
}
};
void solve() {
ll n, q;
cin >> n >> q;
vector<ll> arr(n);
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
sparce_table st(arr);
for (ll i = 0; i < q; i++) {
ll l, r, t;
cin >> t >> l >> r;
l--;
cout << st.get(max(0ll, l - t), r).first << '\n';
}
}
int main() {
if (IS_FILE) {
freopen("", "r", stdin);
freopen("", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
if (IS_TEST_CASES) {
cin >> t;
}
for (ll i = 0; i < t; i++) {
solve();
}
}
