//#define LOCAL
#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 1010101
#define MAXQ 101010
#define INF 1'000'000'100
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1000000007
#define TC 1
#ifdef LOCAL
#define DEBUG(a) cout<<a
#else
#define DEBUG(...) 1234
#endif
#define B 2000
int A[MAX];
priority_queue<int> all[MAX];
priority_queue<int, vector<int>, greater<int>> upd[MAX];
int N, Q;
void refresh(int id) {
int i;
while (all[id].size()) all[id].pop();
for (i = id * B; i < min(N, (id + 1) * B); i++) all[id].push(A[i]);
}
void prop(int id) {
int i;
for (i = id * B; i < min(N, (id + 1) * B); i++) {
upd[id].emplace(A[i]);
A[i] = upd[id].top();
upd[id].pop();
}
upd[id] = {};
}
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> N >> Q;
int i;
for (i = 0; i < N; i++) cin >> A[i];
auto f = [&](int l, int r, int x) {
int i;
i = l;
while (i <= r) {
int b = i / B;
if ((i % B == 0) && i + B - 1 <= r) {
//DEBUG("ii" << i << ln);
if (upd[b].empty()) refresh(b);
upd[b].push(x);
all[b].push(x);
x = all[b].top();
all[b].pop();
i += B;
//DEBUG('x' << x << bb);
}
else {
if (upd[b].size()) prop(b);
//DEBUG('i' << i << bb << A[i] << bb << x << ln);
if (A[i] > x) swap(A[i], x);
i++;
//DEBUG('y' << x << bb);
}
}
return x;
};
while (Q--) {
int l, r, x;
cin >> l >> r >> x;
l--;
r--;
if (l > r) {
x = f(l, N - 1, x);
x = f(0, r, x);
}
else x = f(l, r, x);
cout << x << ln;
}
}
