#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=1000005;
const int INF=1e9;
struct segtree{
struct seg{
vector<int> v;
int val=0;
}tr[N<<2];
seg merge(seg a,seg b){
seg ans;
ans.val=max(a.val,b.val);
auto &c=a.v,&d=b.v;
int ptr1=0,ptr2=0;
while(ptr1<c.size()&&ptr2<d.size()){
if(c[ptr1]<=d[ptr2]){
if(ptr2>0)ans.val=max(ans.val,c[ptr1]+d[ptr2-1]);
ans.v.push_back(c[ptr1++]);
}
else{
ans.v.push_back(d[ptr2++]);
}
}
while(ptr1<c.size()){
if(ptr2>0)ans.val=max(ans.val,c[ptr1]+d[ptr2-1]);
ans.v.push_back(c[ptr1++]);
}
while(ptr2<d.size()){
ans.v.push_back(d[ptr2++]);
}
return ans;
}
void build(vector<int> &a,int id,int l,int r){
if(r-l==1){
tr[id].v.push_back(a[l]);
return;
}
int m=(l+r)>>1;
build(a,id<<1,l,m);
build(a,id<<1|1,m,r);
tr[id]=merge(tr[id<<1],tr[id<<1|1]);
}
seg ask(int id,int a,int b,int l,int r){
if(a<=l&&b>=r)return tr[id];
int m=(l+r)>>1;
if(b<=m)return ask(id<<1,a,b,l,m);
if(a>=m)return ask(id<<1|1,a,b,m,r);
return merge(ask(id<<1,a,b,l,m),ask(id<<1|1,a,b,m,r));
}
};
int32_t main() {
LCBorz;
int n,q;cin>>n>>q;
vector<int> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
segtree st;
st.build(v,1,0,n);
if(n>5000){
while(1){}
}
for(int i=0;i<q;i++){
int l,r,c;cin>>l>>r>>c;
segtree::seg t=st.ask(1,l-1,r,0,n);
cout<<(t.val<=c)<<endl;
}
return 0;
}
