#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sqr(x) (x)*(x)
#define pw(x) (1ll << x)
using namespace std;
typedef long double ld;
const int MAXN = 1123456;
const int N = 2e6 + 200;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());
template <typename T> void vout(T s){cout << s << endl;exit(0);}
pair<pair<int, int>, int> b[N];
pair<int, int> v[N];
int t[4 * N],a[N],n,Q,limit,l,r,x,ans[N],q[N],step;
int pos, val;
void upd(int v,int tl,int tr)
{
if(tl == tr)
{
t[v] = val + a[tl];
return;
}
int tm = (tl + tr) >> 1;
if(pos <= tm) upd(v << 1, tl, tm);
else upd(v << 1 | 1, tm + 1, tr);
t[v] = max(t[v << 1], t[v << 1 | 1]);
}
int get(int v,int tl,int tr)
{
if(tr < l || tl > r) return 0;
if(tl >= l && tr <= r) return t[v];
int tm = (tl + tr) >> 1;
return max(get(v << 1, tl, tm), get(v << 1 | 1, tm + 1, tr));
}
void make(int l,int r)
{
int x,Pos;
for(int i = r; i >= l; i--)
{
x = a[i];
while(step > 0 && x > v[step].fi)
{
Pos = v[step].se;
pos = Pos;
val = x;
upd(1, 1, n);
step--;
}
v[++step] = {x, i};
}
}
bool comp(int i,int j)
{
return (b[i].fi.fi > b[j].fi.fi) || (b[i].fi.fi == b[j].fi.fi && (m_p(b[i].fi.se, b[i].se) < m_p(b[j].fi.se, b[j].se)));
}
int main()
{
ios_base::sync_with_stdio();cin.tie(0);cout.tie(0);
cin>>n>>Q;
for(int i = 1; i <= n; i++) cin>>a[i];
limit = n;
for(int i = 1; i <= Q; i++)
{
cin>>l>>r>>x;
b[i] = {{l, r}, x};
q[i] = i;
}
stable_sort(q + 1, q + Q + 1, comp);
for(int i,j = 1; j <= Q; j++)
{
i = q[j];
l = b[i].fi.fi;
r = b[i].fi.se;
if(limit >= l)
{
make(l, limit);
limit = l - 1;
}
x = get(1, 1, n);
ans[i] = (x <= b[i].se);
}
for(int i = 1; i <= Q; i++) cout<<ans[i]<<"\n";
return 0;
}
