//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
int t[2200000];
void update(int v, int tl, int tr, int pos, int val){
if (tl == tr){
t[v] = max(t[v], val);
return;
}
int tm = (tl + tr) >> 1;
if (pos <= tm) update(v + v, tl, tm, pos, val); else
update(v + v + 1, tm + 1, tr, pos, val);
t[v] = max(t[v + v], t[v + v + 1]);
}
int get(int v, int tl, int tr, int l, int r){
if (l <= tl && tr <= r) return t[v];
if (tl > r || tr < l) return 0;
int tm = (tl + tr) >> 1;
return max(get(v + v, tl, tm, l, r), get(v + v + 1, tm + 1, tr, l, r));
}
int a[1000005];
vector<pair<int, pair<int, int>>> queries[1000005];
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int n, q;
cin >> n >> q;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
for (int i = 1; i <= q; i++){
int l, r, k;
cin >> l >> r >> k;
queries[r].emplace_back(l, make_pair(k, i));
}
bitset<200001> ans;
a[0] = 2e9;
stack<int> st;
st.push(0);
for (int i = 1; i <= n; i++){
while (!st.empty() && a[st.top()] <= a[i]) st.pop();
int j = st.top();
if (j != 0) update(1, 1, n, j, a[j] + a[i]);
for (auto qu : queries[i]){
int l = qu.first, k = qu.second.first, ind = qu.second.second;
ans[ind] = get(1, 1, n, l, i) <= k;
}
st.push(i);
}
for (int i = 1; i <= q; i++) cout << ans[i] << '\n';
return 0;
}
