#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int mod = 1e9 + 7, inf = 1e17;
struct segment_tree {
int n;
vector<int> t;
segment_tree(int n) : n(n), t(n << 2, -inf) {}
void update(int i, int x, int v = 1, int l = 0, int r = -1) {
if (r < 0) r += n;
if (l == r) t[v] = max(t[v], x);
else {
int m = (l + r) >> 1;
if (i <= m) update(i, x, v << 1, l, m);
else update(i, x, v << 1 | 1, m + 1, r);
t[v] = max(t[v], x);
}
}
int get(int L, int R, int v = 1, int l = 0, int r = -1) {
if (L > R) return -inf;
if (r < 0) r += n;
if (L <= l && r <= R) return t[v];
int m = (l + r) >> 1;
if (R <= m) return get(L, R, v << 1, l, m);
if (L > m) return get(L, R, v << 1 | 1, m + 1, r);
return max(get(L, R, v << 1, l, m), get(L, R, v << 1 | 1, m + 1, r));
}
};
int32_t main() {
#ifdef JahonaliX
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, q, m;
cin >> n >> q;
vector<int> a(n), b(n), u;
for (int &i : a) cin >> i, u.emplace_back(i);
sort(u.begin(), u.end()), u.erase(unique(u.begin(), u.end()), u.end()), m = u.size();
for (int i = 0; i < n; ++i) b[i] = lower_bound(u.begin(), u.end(), a[i]) - u.begin();
segment_tree s(m);
while (q--) {
int l, r, k;
cin >> l >> r >> k, l--, r--;
bool ok = true;
for (int i = l; i <= r; ++i) s.update(b[i], a[i]), ok &= s.get(b[i] + 1, m - 1) + a[i] <= k;
cout << ok << '\n';
}
return 0;
}
