#include <bits/stdc++.h>
using namespace std;
struct segment_tree{
vector<int> st;
segment_tree(int n) : st(n << 2) {}
void build(int id, int l, int r, const vector<int>& S){
if(l == r) st[id] = S[l];
else{
int mid = l + r >> 1;
build(id << 1, l, mid, S);
build(id << 1 | 1, mid + 1, r, S);
st[id] = max(st[id << 1], st[id << 1 | 1]);
}
}
int query(int id, int l, int r, int u, int v){
if(v < l || u > r) return 0;
if(u <= l && r <= v) return st[id];
int mid = l + r >> 1;
return max(query(id << 1, l, mid, u, v), query(id << 1 | 1, mid + 1, r, u, v));
}
};
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("task.inp", "r", stdin);
freopen("task.out", "w", stdout);
#endif // LOCAL
int N, Q;
cin >> N >> Q;
vector<int> S(N + 1);
for(int i = 1; i <= N; ++i) cin >> S[i];
segment_tree st(N);
st.build(1, 1, N, S);
for(int i = 0; i < Q; ++i){
int t, l, r;
cin >> t >> l >> r;
cout << st.query(1, 1, N, l - t, l) << '\n';
}
return 0;
}
/*
*/
