#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) {}
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] = 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 << 1], t[v << 1 | 1]);
}
}
int get(int L, int R, int v = 1, int l = 0, int r = -1) {
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;
cin >> n >> q;
vector<int> a(n), l(q), r(q), k(q), ans(q);
vector<vector<int>> o(n);
for (int &i : a) cin >> i;
for (int i = 0; i < q; ++i) cin >> l[i] >> r[i] >> k[i], l[i]--, r[i]--, o[l[i]].emplace_back(i);
stack<int> st;
segment_tree s(n);
for (int i = n - 1; i >= 0; --i) {
while (st.size() && a[st.top()] < a[i]) s.update(st.top(), a[st.top()] + a[i]), st.pop();
for (int j : o[i]) ans[j] = (s.get(l[j], r[j]) <= k[j]);
st.emplace(i);
}
for (int i : ans) cout << i << '\n';
return 0;
}
