#include <bits/stdc++.h>
using namespace std;
#define sz(s) (int)s.size()
#define ff first
#define ss second
#define ll long long
const int N = 1e6 + 5;
int n, m, a[N], mmx;
ll b[N*4], x3;
vector <vector <int>> st;
void bld(int nd, int l, int r){
if(l == r){
st[nd].push_back(a[l]);
return;
}
int md = (l + r) / 2;
bld(nd*2,l,md);
bld(nd*2+1,md+1,r);
st[nd].resize(sz(st[nd*2]) + sz(st[nd*2+1]));
merge(st[nd*2].begin(), st[nd*2].end(), st[nd*2+1].begin(), st[nd*2+1].end(), st[nd].begin());
int mx = 0;
for(int i = l; i <= r; i++){
x3 = mx;
x3 += a[i];
if(mx > a[i]) b[nd] = max(b[nd],x3);
mx = max(mx,a[i]);
}
return;
}
ll fnd(int nd, int l, int r, int x, int y){
if(r < x or l > y) return 0;
if(l >= x and r <= y){
int t = lower_bound(st[nd].begin(), st[nd].end(), mmx) - st[nd].begin();
ll k = 0;
if(t != 0) k = (mmx + st[nd][t-1]);
k = max(k,b[nd]);
mmx = max(mmx,st[nd].back());
return k;
}
int md = (l + r) / 2;
ll x1 = fnd(nd*2,l,md,x,y);
ll x2 = fnd(nd*2+1,md+1,r,x,y);
return max(x1,x2);
}
int main(){
ios::sync_with_stdio (false); cin.tie(nullptr);
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
st.resize(n*4);
bld(1,1,n);
int l, r;
ll k;
for(int i = 1; i <= m; i++){
cin >> l >> r >> k;
mmx = 0;
cout << (fnd(1,1,n,l,r) > k ? 0 : 1) << '\n';
}
}
