#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, m, ans[N], t[4 * N], a[N], _l[N], _k[N];
vector <int> que[N];
stack <int> st;
void upd(int i, int l, int r, int pos, int val)
{
if(l == r)
{
t[i] = val;
return ;
}
int mid = l + r >> 1;
if(pos <= mid) upd(i << 1, l, mid, pos, val);
else upd(i << 1 | 1, mid + 1, r, pos, val);
t[i] = max(t[i << 1], t[i << 1 | 1]);
}
int get(int i, int l, int r, int u, int v)
{
if(l > v || u > r) return 0;
if(u <= l && r <= v) return t[i];
int mid = l + r >> 1;
return max(get(i << 1, l, mid, u, v), get(i << 1 | 1, mid + 1, r, u, v));
}
main ()
{
cin.tie(0)->sync_with_stdio(0);
if(fopen("task.inp", "r"))
{
freopen("task.inp", "r", stdin);
freopen("wa.out", "w", stdout);
}
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i <= m; i++)
{
int r; cin >> _l[i] >> r >> _k[i];
que[r].push_back(i);
}
for(int i = 1; i <= n; i++)
{
while (!st.empty() && a[st.top()] <= a[i]) st.pop();
if(!st.empty()) upd(1, 1, n, st.top(), a[st.top()] + a[i]);
for(int j : que[i])
{
int l = _l[j], k = _k[j];
ans[j] = (get(1, 1, n, l, i) <= k) ? 1 : 0;
}
st.push(i);
}
for(int i = 1; i <= m; i++) cout << ans[i] << "\n";
}
