#include <bits/stdc++.h>
using namespace std;
const int MXN = 1e6 + 5;
int n, q;
int a[MXN];
vector<int> st[MXN << 2];
int mx[MXN << 2];
void build(int l, int r, int x)
{
mx[x] = 0;
if (l == r)
{
st[x].push_back(a[l]);
return;
}
int mid = (l + r) >> 1;
build(l, mid, 2*x), build(mid + 1, r, 2*x + 1);
st[x].resize(st[2*x].size() + st[2*x + 1].size());
merge(st[2*x].begin(), st[2*x].end(), st[2*x + 1].begin(), st[2*x + 1].end(), st[x].begin());
if (st[2*x].back() > st[2*x + 1][0]) mx[x] = st[2*x].back() + *--lower_bound(st[2*x + 1].begin(), st[2*x + 1].end(), st[2*x].back());
mx[x] = max({mx[x], mx[2*x], mx[2*x + 1]});
}
vector<int> res;
void get(int l, int r, int x, int lx, int rx)
{
if (l > rx || r < lx) return;
if (l >= lx && r <= rx)
{
res.push_back(x);
return;
}
int mid = (l + r) >> 1;
get(l, mid, 2*x, lx, rx);
get(mid + 1, r, 2*x + 1, lx, rx);
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; i++) cin >> a[i];
build(1, n, 1);
while (q--)
{
res.clear();
int l, r, x;
cin >> l >> r >> x;
get(1, n, 1, l, r);
int curmx = 0, ans = 0;
for (int &i : res) ans = max(ans, mx[i]);
for (int i = 0; i + 1 < res.size(); i++)
{
int l = res[i], r = res[i + 1];
curmx = max(curmx, st[l].back());
if (curmx > st[r][0]) ans = max(ans, curmx + *--lower_bound(st[r].begin(), st[r].end(), curmx));
}
cout << (ans <= x) << '\n';
}
}
