#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define sui cout.tie(NULL); cin.tie(NULL); ios_base::sync_with_stdio(false)
#define lid id << 1
#define rid id << 1 | 1
#define mid ((r + l) >> 1)
const int MAX_N = 1e6 + 5;
const int MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
const int LOG = 30;
int seg[MAX_N << 2];
bool have[MAX_N << 2];
int ops[MAX_N << 2];
void move(int l, int r, int id)
{
if (l == r - 1) return;
if (have[lid]) seg[lid] += ops[id];
if (have[rid]) seg[rid] += ops[id];
ops[lid] += ops[id];
ops[rid] += ops[id];
ops[id] = 0;
}
void upd(int s, int t, int x, int l, int r, int id)
{
move(l, r, id);
if (s <= l && t >= r)
{
if (have[id]) seg[id] += x;
ops[id] += x;
return;
}
if (s < mid) upd(s, t, x, l, mid, lid);
if (t > mid) upd(s, t, x, mid, r, rid);
seg[id] = max(seg[lid], seg[rid]);
}
void upd2(int x, int y, int l, int r, int id)
{
move(l, r, id);
if (l == r - 1)
{
seg[id] = y;
have[id] = true;
return;
}
if (x < mid) upd2(x, y, l, mid, lid);
else upd2(x, y, mid, r, rid);
seg[id] = max(seg[lid], seg[rid]);
have[id] = have[lid] || have[rid];
}
int get(int s, int t, int l, int r, int id)
{
move(l, r, id);
if (s <= l && t >= r) return seg[id];
if (s >= r || t <= l) return 0;
return max(get(s, t, l, mid, lid), get(s, t, mid, r, rid));
}
void solve() {
int n, m;
cin >> n >> m;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
vector<pair<int, pair<int, int>>> qs[n];
for (int i = 0; i < m; i++)
{
int l, r, k;
cin >> l >> r >> k;
l--;
r--;
qs[l].push_back(make_pair(r, make_pair(k, i)));
}
vector<int> add[n];
vector<int> al;
for (int i = 0; i < n; i++)
{
while (al.size() && a[al.back()] <= a[i]) al.pop_back();
if (al.size()) add[al.back()].push_back(i);
al.push_back(i);
}
al.clear();
int ans[m];
for (int i = n - 1; i >= 0; i--)
{
while (al.size() && a[al.back()] <= a[i])
{
int ind = al.back();
al.pop_back();
upd(ind, (al.size() ? al.back() : n), a[i] - a[ind], 0, n, 1);
}
al.push_back(i);
for (int x : add[i]) upd2(x, a[i] + a[x], 0, n, 1);
for (auto x : qs[i]) ans[x.second.second] = (get(i, x.first + 1, 0, n, 1) > x.second.first ? 0 : 1);
}
for (int i = 0; i < m; i++) cout << ans[i] << "\n";
}
int main() {
sui;
int tc = 1;
//cin >> tc;
for (int t = 1; t <= tc; t++) {
solve();
}
}
