#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> struct Fenwick {
int n;
std::vector<T> a;
Fenwick(int n_ = 0) { init(n_); }
void init(int n_) {
n = n_;
a.assign(n, T{});
}
void add(int x, const T &v) {
for (int i = x + 1; i <= n; i += i & -i) {
a[i - 1] = max(a[i - 1], v);
}
}
T sum(int x) {
T ans{};
for (int i = x; i > 0; i -= i & -i) {
ans = max(ans, a[i - 1]);
}
return ans;
}
T rangeSum(int l, int r) { return sum(r) - sum(l); }
int select(const T &k) {
int x = 0;
T cur{};
for (int i = 1 << std::__lg(n); i; i /= 2) {
if (x + i <= n && cur + a[x + i - 1] <= k) {
x += i;
cur = cur + a[x - 1];
}
}
return x;
}
};
struct Qry {
int l, id;
ll k;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
cin >> n >> q;
vector<ll> a(n);
for (auto &i : a)
cin >> i;
Fenwick<ll> ft(n);
vector<vector<Qry>> Q(n);
for (int j = 0; j < q; ++j) {
int l, r, k;
cin >> l >> r >> k;
Q[r - 1].push_back({l - 1, j, k});
}
vector<int> st, ans(q);
for (int r = 0; r < n; ++r) {
while (st.size() && a[st.back()] <= a[r])
st.pop_back();
if (st.size()) {
ft.add(n - 1 - st.back(), a[st.back()] + a[r]);
}
st.push_back(r);
for (auto qry : Q[r]) {
ans[qry.id] = (ft.sum(n - qry.l) <= qry.k);
}
}
for (auto x : ans)
cout << x << "\n";
return 0;
}
