#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(I, L, R) for(int I(L) ; I <= (int)R ; ++I)
#define FOD(I, R, L) for(int I(R) ; I >= (int)L ; --I)
#define FOA(I, A) for(auto &I : A)
#define print(A,L,R) FOR(OK, L, R){if(A[OK]<=-oo / 10||A[OK]>=oo)cout<<"- ";else cout<<A[OK]<<' ';}cout<<'\n';
#define prints(A) FOA(OK, A){cout<<OK<<' ';}cout << '\n';
#define printz(A,L,R) FOR(OK, 0, L){FOR(KO, 0, R){if(A[OK][KO]>-oo&&A[OK][KO]<oo)cout<<A[OK][KO]<<' ';else cout << "- ";} cout << '\n';}cout << '\n';
#define fs first
#define sd second
#define se sd.fs
#define th sd.sd
#define ii pair<int,int>
#define iii pair<int, ii>
#define all(A) A.begin(), A.end()
#define quickly cin.tie(0) -> ios_base::sync_with_stdio(0);
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int oo = 1e9;
int n, q;
int pos[N], ans[N], a[N];
stack<int> st;
vector<iii> sweep[N];
struct SegmentTree{
int sg[N << 2];
void update(int id, int l, int r, int pos, int val){
if(l > pos || r < pos){
return;
}
if(l == r){
sg[id] = max(sg[id], val);
return;
}
int mid = (l + r) >> 1;
update(id << 1, l, mid, pos, val);
update(id << 1 | 1, mid + 1, r, pos, val);
sg[id] = max(sg[id << 1], sg[id << 1 | 1]);
}
int get(int id, int l, int r, int u, int v){
if(l > v || r < u){
return -oo;
}
if(u <= l && r <= v){
return sg[id];
}
int mid = (l + r) >> 1;
return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
}
} sg;
signed main(){ quickly
cin >> n >> q;
FOR(i, 1, n){
cin >> a[i];
while(!st.empty() && a[st.top()] <= a[i]){
st.pop();
}
if(!st.empty()){
pos[i] = st.top();
}
st.push(i);
}
FOR(i, 1, q){
int l, r, k;
cin >> l >> r >> k;
sweep[r].push_back({l, {k, i}});
}
FOR(r, 1, n){
sg.update(1, 1, n, pos[r], a[pos[r]] + a[r]);
FOA(item, sweep[r]){
int l = item.fs, k = item.se, in = item.th;
if(sg.get(1, 1, n, l, r) <= k){
ans[in] = 1;
}
}
}
FOR(i, 1, q){
cout << ans[i] << '\n';
}
}
