#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
template <class X, class Y>
inline bool maximize(X &x, Y y) {
return (x < y ? x = y, true : false);
}
template <class X, class Y>
inline bool minimize(X &x, Y y) {
return (x > y ? x = y, true : false);
}
template <class X>
inline void compress(vector<X> &a) {
sort(all(a));
a.resize(unique(all(a)) - a.begin());
}
int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
return l + abs((ll) rng()) % (r - l + 1);
}
const ll oo = (ll) 1e17;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;
const int N = 1e6 + 5, M = 2e5 + 5, BASE = 307, LOG = 23;
void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }
int n, m;
int a[N];
struct Seg {
int n;
vector<int> st, lz;
Seg(int n) : n(n) {
st.resize(n << 2);
lz.resize(n << 2);
}
void setNode(int i, int x) {
st[i] += x;
lz[i] += x;
}
void down(int i) {
if (!lz[i]) return;
setNode(2 * i, lz[i]);
setNode(2 * i + 1, lz[i]);
lz[i] = 0;
return;
}
void upd(int i, int l, int r, int u, int v, int x) {
if (l > v || r < u) return;
if (l >= u && r <= v) return setNode(i, x);
down(i);
int m = (l + r) >> 1;
upd(2 * i, l, m, u, v, x);
upd(2 * i + 1, m + 1, r, u, v, x);
st[i] = max(st[2 * i], st[2 * i + 1]);
}
void upd(int u, int v, int x) {
if (u > v) return;
return upd(1, 1, n, u, v, x);
}
int get(int i, int l, int r, int u, int v) {
if (l > v || r < u) return -inf;
if (l >= u && r <= v) return st[i];
down(i);
int m = (l + r) >> 1;
return max(get(2 * i, l, m, u, v), get(2 * i + 1, m + 1, r, u, v));
}
int get(int u, int v) {
return get(1, 1, n, u, v);
}
};
bool res[N];
vector<array<ll, 3>> queries[N];
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
rep(i, n) cin >> a[i];
rep(i, m) {
int l, r, k;
cin >> l >> r >> k;
queries[l].pb({r, k, i});
}
Seg s(n);
stack<int> st;
ford(i, n, 1) {
while (sz(st) && a[st.top()] < a[i]) {
int cur = st.top();
st.pop();
int lst = n;
if (sz(st)) lst = st.top() - 1;
s.upd(cur, cur, a[cur]);
s.upd(cur + 1, lst, -a[cur]);
}
int cur = n;
if (sz(st)) cur = st.top() - 1;
st.push(i);
s.upd(i + 1, cur, a[i]);
for (array<ll, 3> q : queries[i]) {
res[q[2]] = s.get(i, q[0]) <= q[1];
}
}
rep(i, m) cout << res[i] << '\n';
return 0;
}
