#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
vi segt[4000001];
int n,m,ans[4000001],ans1;
int arr[1000001];
void merge(int node)
{
int s=0,s1=0;
while(s!=segt[2*node+1].size()||s1!=segt[2*node+2].size())
{
if(s!=segt[2*node+1].size()&&(s1==segt[2*node+2].size()||segt[2*node+1][s]<segt[2*node+2][s1]))
{
segt[node].pb(segt[2*node+1][s]);
s++;
}
else
{
segt[node].pb(segt[2*node+2][s1]);
s1++;
}
}
}
void build(int node,int l,int r)
{
if(l==r)
{
ans[node]=0;
segt[node].pb(arr[l]);
return;
}
int m=(l+r)/2;
build(2*node+1,l,m);
build(2*node+2,m+1,r);
merge(node);
ans[node]=max(ans[2*node+1],ans[2*node+2]);
int it=lower_bound(all(segt[2*node+2]),*(--segt[2*node+1].end()))-segt[2*node+2].begin();
if(it!=0)
{
it--;
ans[node]=max(ans[node],*(--segt[2*node+1].end())+segt[2*node+2][it]);
}
}
ii qu(int node,int l,int r,int s,int e,int cm)
{
if(l>e||r<s)
return(mp(0,cm));
if(l>=s&&r<=e)
{
int it=lower_bound(all(segt[node]),cm)-segt[node].begin();
ans1=0;
if(it!=0)
{
it--;
ans1=cm+segt[node][it];
}
return(mp(max(ans[node],ans1),max(cm,(*(--segt[node].end())))));
}
int m=(l+r)/2;
ii q1=qu(2*node+1,l,m,s,e,cm);
ii q2=qu(2*node+2,m+1,r,s,e,q1.S);
return(mp(max(q1.F,q2.F),q2.S));
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m;
for(int i=0;i<n;++i)
cin>>arr[i];
build(0,0,n-1);
for(int i=0;i<m;++i)
{
int f,s,k;
cin>>f>>s>>k;
f--;
s--;
ii a=qu(0,0,n-1,f,s,arr[f]);
if(a.F<=k)
cout<<1<<'\n';
else
cout<<0<<'\n';
}
return(0);
}
