#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int q[N],der[4*N],a[N],ans;
vector <int> tr[N*4];
void mer(vector <int> &a,vector <int> &b,vector <int> &v,int &mx){
int l=0,r=0;
while (l < a.size() && r < b.size()){
if (a[l] <= b[r]){
v.pb(a[l]);
l++;
}
else {
mx = max(mx,a[l]+b[r]);
v.pb(b[r]);
r++;
}
}
while (l < a.size()){
if (!b.empty())
mx = max(mx,a[l]+b.back());
v.pb(a[l]);
l++;
}
while (r < b.size()){
v.pb(b[r]);
r++;
}
}
void build(int v,int l,int r){
if (l==r){
der[v] = 0;
tr[v].pb(q[l]);
}
else {
int m=l+r>>1;
build(v<<1,l,m);
build((v<<1)+1,m+1,r);
int mx = max(der[v<<1],der[(v<<1)+1]);
mer(tr[v<<1],tr[(v<<1)+1],tr[v],mx);
der[v] = mx;
}
}
vector <int> get_ans(int v,int l,int r,int ql,int qr){
if (l> qr || r < ql)ret {};
if (ql <= l && r <= qr){
ans = max(ans,der[v]);
ret tr[v];
}
int m = l +r>>1;
vector <int> a,b,c;
a = get_ans(v<<1,l,m,ql,qr);
b = get_ans((v<<1)+1,m+1,r,ql,qr);
mer(a,b,c,ans);
ret c;
}
main(){
int n,t,i,j;
scan2(n,t)
for (i=1;i<=n;++i){
scan1(q[i])
}
build(1,1,n);
while (t--){
int l,r,k;
scan3(l,r,k)
vector <int> v = get_ans(1,1,n,l,r);
cout <<(ans<=k)<<"\n";
ans=0;
}
}
