#include <bits/stdc++.h>
#define noSuccess t--
#define int long long
#define pb push_back
#define F first
#define S second
#define Sattar_is_the_best ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(s) s.begin(),s.end()
#define yes "YES\n"
#define no "NO\n"
#define sz size
using namespace std;
const int maxn = 2e6;
const int mod = 1e9 + 7;
int n,q,a[maxn];
int t[maxn];
int get(int v,int tl,int tr,int l,int r){
if(tl>r || tr<l) return 0;
if(l<=tl && tr<=r) return t[v];
int mid = tl + tr >>1;
return max(get(v+v,tl,mid,l,r),get(v+v+1,mid+1,tr,l,r));
}
void build(int v,int l,int r){
if(l==r){
t[v]=a[l];
return;
}
int mid = l + r >> 1;
build(v+v,l,mid);
build(v+v+1,mid+1,r);
t[v]=max(t[v+v],t[v+v+1]);
}
void tryAgain(){
cin>>n>>q;
int mn=INT_MAX;
for(int i=1;i<=n;i++){
cin>>a[i];
mn=min(mn,a[i]);
}
build(1,1,n);
for(int ii=1;ii<=q;ii++){
int l,r,k;
cin>>l>>r>>k;
int b[n+4];
for(int j=l;j<=r;j++){
b[j-l+1]=a[j];
}
int len=r-l+1;
reverse(b+1,b+1+len);
set<int>st;
int ok=1;
for(int i=1;i<=len;i++){
// cout<<b[i]<<' ';
if(st.empty()){
st.insert(b[i]);
continue;
}
if(*st.begin()>=b[i]){
st.insert(b[i]);
continue;
}
for(auto to : st){
if(to>=b[i]) break;
if(to+b[i]>k){
// cout<<to<<' '<<b[i]<<'\n';
ok=0;
break;
}
}
st.insert(b[i]);
if(ok==0) break;
}
cout<<ok<<'\n';
}
}
signed main(){
Sattar_is_the_best
// freopen("length.in", "r", stdin);
// freopen("length.out", "w", stdout);
int t = 1;
// cin >> t;
while(noSuccess){
tryAgain();
}
}
