#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 sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int q[N],ct[N],der[4*N];
void update(int v,int l,int r,int x,int y){
if (l == x && r == x){
der[v] = y;
}
else {
int m = l+r>>1;
if (m<x)
update((v<<1)+1,m+1,r,x,y);
else
update(v<<1,l,m,x,y);
der[v]=max(der[v<<1],der[(v<<1)+1]);
}
}
int get_ans(int v,int l,int r,int ql,int qr){
if (qr < l || ql > r)ret 0;
if (ql <= l && r<= qr)ret der[v];
int m = l+r>>1;
ret max(get_ans(v<<1,l,m,ql,qr),get_ans((v<<1)+1,m+1,r,ql,qr));
}
main(){
deque <pair<pii,pii> > v;
int n,t,i,j,cnt=1,res=0;
scan2(n,t)
for (i=1;i<=n;++i){
scan1(q[i])
}
while (t--){
int l,r,k;
scan3(l,r,k)
v.pb({{r,l},{k,cnt++}});
}
sort(all(v));
vector <pii> ans;
for (i=1;i<=n;++i){
while (!ans.empty() && ans.back().fr < q[i]){
ans.pop_back();
}
bool f=0;
if (ans.empty()){
ans.pb({q[i],i});
f=1;
}
int x = ans.back().fr;
int y = ans.back().sc;
if (!f)
ans.pb({q[i],i});
if (x > q[i]){
update(1,1,n,y,x+q[i]);
}
while (!v.empty() && v[0].fr.fr == i){
res = get_ans(1,1,n,v[0].fr.sc,i);
ct[v[0].sc.sc] = (v[0].sc.fr >=res);
v.pop_front();
}
}
for (i=1;i<cnt;++i)
cout <<ct[i]<<"\n";
}
