#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a[1000'000];
int w[1000'000], ans[1000'000];
vector<int> t[4000'000];
int tmax[4000'000];
struct UPD
{
int maxAtLeft, q;
};
vector<UPD> upd[4000'000];
int tans[4000'000], p[4000'000];
inline int Max(const vector<int>& x) { return x.back(); }
void Build(int v, int vl, int vr)
{
if (vl == vr)
{
tans[v] = 0;
t[v].push_back(a[vr]);
tmax[v] = a[vr];
return;
}
int vm = vl + (vr - vl) / 2;
Build(v * 2, vl, vm);
Build(v * 2 + 1, vm + 1, vr);
tmax[v] = max(tmax[v * 2], tmax[v * 2 + 1]);
t[v].reserve(vr - vl + 1);
merge(t[v * 2].begin(), t[v * 2].end(),
t[v * 2 + 1].begin(), t[v * 2 + 1].end(),
back_inserter(t[v]));
tans[v] = max(tans[v * 2], tans[v * 2 + 1]);
auto smaller = lower_bound(t[v * 2 + 1].begin(), t[v * 2 + 1].end(), tmax[v * 2]);
if (smaller != t[v * 2 + 1].begin())
tans[v] = max(tans[v], tmax[v * 2] + *--smaller);
vector<int>().swap(t[v * 2]);
vector<int>().swap(t[v * 2 + 1]);
}
int Query(int v, int vl, int vr, int l, int r, int maxAtLeft, int q)
{
if (l > vr || vl > r)
return 0;
if (l <= vl && vr <= r)
{
ans[q] = max(ans[q], tans[v]);
upd[v].push_back(UPD());
upd[v].back().maxAtLeft = maxAtLeft;
upd[v].back().q = q;
return tmax[v];
}
int vm = vl + (vr - vl) / 2;
maxAtLeft = max(Query(v * 2, vl, vm, l, r, maxAtLeft, q), maxAtLeft);
maxAtLeft = max(Query(v * 2 + 1, vm + 1, vr, l, r, maxAtLeft, q), maxAtLeft);
return maxAtLeft;
}
void Solve(int v, int vl, int vr)
{
upd[v].shrink_to_fit();
if (vl == vr)
{
t[v].push_back(a[vr]);
t[v].shrink_to_fit();
}
else
{
int vm = vl + (vr - vl) / 2;
Build(v * 2, vl, vm);
Build(v * 2 + 1, vm + 1, vr);
t[v].clear();
t[v].reserve(vr - vl + 1);
merge(t[v * 2].begin(), t[v * 2].end(),
t[v * 2 + 1].begin(), t[v * 2 + 1].end(),
back_inserter(t[v]));
vector<int>().swap(t[v * 2]);
vector<int>().swap(t[v * 2 + 1]);
}
p[v] = vr - vl;
sort(upd[v].begin(), upd[v].end(), [](const UPD& l, const UPD& r) {
return l.maxAtLeft > r.maxAtLeft;
});
for (UPD x: upd[v])
{
int maxAtLeft = x.maxAtLeft, q = x.q;
while (p[v] >= 0 && t[v][p[v]] >= maxAtLeft)
--p[v];
if (p[v] >= 0)
ans[q] = max(ans[q], maxAtLeft + t[v][p[v]]);
}
vector<UPD>().swap(upd[v]);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> a[i];
Build(1, 0, n - 1);
for (int i = 0; i < m; ++i)
{
ans[i] = 0;
int l, r;
cin >> l >> r >> w[i];
Query(1, 0, n - 1, --l, --r, 0, i);
}
Solve(1, 0, n - 1);
for (int i = 0; i < m; ++i)
cout << (ans[i] <= w[i]) << '\n';
}
