#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 10;
int n, m, q, w[N];
int st_max[4 * N], st_ans[4 * N], lazy[4 * N];
vector<array<int , 3>> query[N];
int ans[N];
void build(int id, int l, int r) {
if (l == r) {
st_max[id] = w[l];
return;
}
int mid = (l + r) / 2;
build(id * 2, l, mid);
build(id * 2 + 1, mid + 1, r);
st_max[id] = max(st_max[id * 2], st_max[id * 2 + 1]);
}
int get(int id, int l, int r, int u, int v, int val) {
if (r < u || v < l) return v + 1;
if (u <= l && r <= v) {
if (l == r) {
if (st_max[id] < val) return v + 1;
return l;
}
int mid = (l + r) / 2;
if (st_max[id * 2] >= val) return get(id * 2, l, mid, u, v, val);
return get(id * 2 + 1, mid + 1, r, u, v, val);
}
int mid = (l + r) / 2;
return min(get(id * 2, l, mid, u, v, val), get(id * 2 + 1, mid + 1, r, u, v, val));
}
void down(int id) {
if (lazy[id] == 0) return;
int k = lazy[id];
st_ans[id * 2] = k + st_max[id * 2];
st_ans[id * 2 + 1] = k + st_max[id * 2 + 1];
lazy[id * 2] = k;
lazy[id * 2 + 1] = k;
lazy[id] = 0;
}
void update(int id, int l, int r, int u, int v, int k) {
if (r < u || v < l) return;
if (u <= l && r <= v) {
st_ans[id] = k + st_max[id];
lazy[id] = k;
return;
}
down(id);
int mid = (l + r) / 2;
update(id * 2, l, mid, u, v, k);
update(id * 2 + 1, mid + 1, r, u, v, k);
st_ans[id] = max(st_ans[id * 2], st_ans[id * 2 + 1]);
}
int get_ans(int id, int l, int r, int u, int v) {
if (r < u || v < l) return 0;
if (u <= l && r <= v) return st_ans[id];
down(id);
int mid = (l + r) / 2;
return max(get_ans(id * 2, l, mid, u, v), get_ans(id * 2 + 1, mid + 1, r, u, v));
}
void prep() {
cin >> n >> m;
for (int i = 1; i <= n; i ++) {
cin >> w[i];
w[i] ++;
}
build(1, 1, n);
int l, r, k;
for (int i = 1; i <= m; i ++) {
cin >> l >> r >> k;
query[l].push_back({r, k, i});
}
}
void solve() {
for (int i = n; i >= 1; i --) {
int t = get(1, 1, n, i + 1, n, w[i]);
//cout << i << " " << t << "\n";
update(1, 1, n, i + 1, t - 1, w[i]);
for (array<int, 3> a : query[i]) {
int x = get_ans(1, 1, n, i, a[0]);
if (x == 0 || x <= a[1] + 2) ans[a[2]] = 1;
//cout << i << " " << a[0] << " : " << x << "\n";
}
}
for (int i = 1; i <= m; i ++) cout << ans[i] << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
prep();
solve();
return 0;
}
