#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define precision \
cout.precision(30); \
cerr.precision(10);
#define ll long long
#define ld long double
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
ll n, m, a[1000005], b[1000005], w[1000005], d[1000005], t[4000005], h[4000005],
la[4000005];
pair<ll, ll> c[1000005];
vector<ll> v, q[1000005];
void build(ll v, ll l, ll r) {
if (l == r) {
h[v] = a[l];
return;
}
ll tm = (l + r) / 2;
build(v + v, l, tm);
build(v + v + 1, tm + 1, r);
h[v] = max(h[v + v], h[v + v + 1]);
}
void push(ll v, ll l, ll r) {
if (!la[v]) return;
if (l != r) {
if (la[v] < 0) {
t[v + v] = h[v + v];
la[v + v] = la[v];
t[v + v + 1] = h[v + v + 1];
la[v + v + 1] = la[v];
} else {
t[v + v] += la[v];
la[v + v] += la[v];
t[v + v + 1] += la[v];
la[v + v + 1] += la[v];
}
}
la[v] = 0;
}
void upd(ll v, ll l, ll r, ll x, ll y, ll z) {
push(v, l, r);
if (r < x || y < l) return;
if (x <= l && r <= y) {
if (z < 0) {
t[v] = h[v];
la[v] = 0;
} else {
t[v] += z;
la[v] += z;
}
push(v, l, r);
return;
}
ll tm = (l + r) / 2;
upd(v + v, l, tm, x, y, z);
upd(v + v + 1, tm + 1, r, x, y, z);
t[v] = max(t[v + v], t[v + v + 1]);
}
ll get(ll v, ll l, ll r, ll x, ll y) {
push(v, l, r);
if (r < x || y < l) return -(1LL << 60);
if (x <= l && r <= y) return t[v];
ll tm = (l + r) / 2;
return max(get(v + v, l, tm, x, y), get(v + v + 1, tm + 1, r, x, y));
}
int main() {
speed;
precision;
// code
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) {
ll l, r, x;
cin >> l >> r >> x;
c[i] = mp(r, x);
q[l].pb(i);
}
for (int i = n; i >= 1; i--) {
while (sz(v) && a[v.back()] < a[i]) v.pop_back();
w[i] = (sz(v) ? v.back() : n + 1) - 1;
v.pb(i);
}
build(1, 1, n);
for (int i = n; i >= 1; i--) {
if (i + 1 <= w[i]) {
upd(1, 1, n, i + 1, w[i], -1);
upd(1, 1, n, i + 1, w[i], a[i]);
}
for (auto j : q[i]) d[j] = (get(1, 1, n, i, c[j].F) <= c[j].S);
}
for (int i = 1; i <= m; i++) cout << d[i] << "\n";
// endl
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
