#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef long double ld;
#define pb push_back
#define pf push_front
#define fi first
#define se second
const ll mod = 1e9+7, mxn = 1e6+7;
struct node
{
vector<ll> v;
ll ans = -mod;
};
void merge(node& c, node& a, node& b)
{
c.ans = max({a.ans, b.ans});
ll p = lower_bound(b.v.begin(), b.v.end(), a.v.back())-b.v.begin()-1;
if (p >= 0) c.ans = max({c.ans,b.v[p]+a.v.back()});
ll id_a = 0, id_b = 0;
while (id_a < a.v.size() && id_b < b.v.size())
{
if (a.v[id_a] < b.v[id_b])
{
if (c.v.empty() || c.v.back() != a.v[id_a]) c.v.pb(a.v[id_a++]);
else id_a++;
}
else
{
if (c.v.empty() || b.v[id_b] != c.v.back()) c.v.pb(b.v[id_b++]);
else id_b++;
}
}
while (id_a < a.v.size())
{
if (c.v.empty() || c.v.back() != a.v[id_a]) c.v.pb(a.v[id_a++]);
else id_a++;
}
while (id_b < b.v.size())
{
if (c.v.empty() || b.v[id_b] != c.v.back()) c.v.pb(b.v[id_b++]);
else id_b++;
}
}
vector<node> st(mxn<<2);
ll a[mxn], n, q, ans, f;
void build(ll id, ll l, ll r)
{
if (l == r) {st[id].v = {a[l]}; return;}
ll m = (r+l)>>1;
build(id<<1,l,m); build(id<<1|1,m+1,r);
merge(st[id], st[id<<1], st[id<<1|1]);
}
void get(ll id, ll l, ll r, ll u, ll v)
{
if (u <= l && r <= v)
{
ans = max({ans, st[id].ans});
ll p = lower_bound(st[id].v.begin(), st[id].v.end(), f)-st[id].v.begin()-1;
if (p >= 0) ans = max({ans, st[id].v[p]+f});
f = max(f, st[id].v.back());
return ;
}
ll m = (r+l)>>1;
if (v <= m) get(id<<1,l,m,u,v);
else if (m+1 <= u) get(id<<1|1,m+1,r,u,v);
else {get(id<<1,l,m,u,v); get(id<<1|1,m+1,r,u,v);}
}
signed main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("test.inp","r",stdin); freopen("test.out","w",stdout); freopen("test.err","w",stderr);
cin >> n >> q;
for (ll i = 1; i <= n; i++) cin >> a[i];
build(1,1,n);
while (q--)
{
ll l, r, k; cin >> l >> r >> k; ans = 0; f = -mod; get(1,1,n,l,r);
cout << (ans <= k) << '\n';
}
}
