#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define ld long double
#define pb push_back
#define pf push_front
#define mod 998244353
#define se second
#define fi first
#define all(ls) (ls).begin(),(ls).end()
#define int long long
using namespace std;
using namespace __gnu_pbds;
template<typename type>using ordered_set=tree<type,null_type,less<type>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename type>using ordered_multiset=tree<type,null_type,less_equal<type>,rb_tree_tag,tree_order_statistics_node_update>;
int t=1,n,q,l,r,k;
const int N=1e6+10;
vector<int>inds;
vector<vector<int>>Q[N];
int a[N],ans[N],seg[4*N];
void upd(int v,int st,int en,int ind,int val){
if(st==en){
seg[v]=val;
return;
}
int mid=(st+en)/2;
if(st<=ind and ind<=mid)
upd(v*2+1,st,mid,ind,val);
if((mid+1)<=ind and ind<=en)
upd(v*2+2,mid+1,en,ind,val);
seg[v]=max(seg[v*2+1],seg[v*2+2]);
}
int get(int v,int st,int en,int l,int r){
if(st>en or st>r or en<l)
return LLONG_MIN;
if(l<=st and en<=r)
return seg[v];
int mid=(st+en)/2;
return max(get(v*2+1,st,mid,l,r),get(v*2+2,mid+1,en,l,r));
}
void solve(){
cin>>n>>q;
for(int i=0;i<n;i++){
cin>>a[i];
upd(0,0,n+1,i,a[i]);
}
for(int i=0;i<q;i++){
cin>>l>>r>>k;
l--;r--;
Q[l].pb({r,i,k});
}
for(int i=0;i<n;i++){
while(inds.size() and a[inds.back()]<=a[i]){
if(inds.size() and a[inds.back()]<a[i])
upd(0,0,n+1,inds.back(),a[inds.back()]+a[i]);
inds.pop_back();
}
inds.pb(a[i]);
for(vector<int> j:Q[i])
ans[j[1]]=(get(0,0,n+1,i,j[0])<=j[2]);
}
for(int i=0;i<q;i++)
cout<<ans[i]<<endl;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cin>>t
for(int i=1;i<=t;i++){
// cout<<"Scenario #"<<i<<":"<<" ";
solve();
}
}
