#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include <time.h>
#endif
#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) \
{ \
++recur_depth; \
auto x_ = x; \
--recur_depth; \
cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":" \
<< __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl; \
}
#else
#define dbg(x)
#endif
using namespace std;
using namespace __gnu_pbds;
typedef pair<int, int> ii;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
tree_order_statistics_node_update>;
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 << '}';
}
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-9;
struct Query {
ll l, r, k, idx;
bool operator<(const Query &other) const { return l < other.l; }
};
struct ST {
int n;
vl t;
ST(int n) : n(n) { t = vl(2 * n + 10); }
ll query(int l, int r) {
ll res = -INF;
for (l += n, r += n; l < r; l /= 2, r /= 2) {
if (l & 1)
res = max(res, t[l++]);
if (r & 1)
res = max(res, t[--r]);
}
return res;
}
void upd(int i, ll v) {
i += n;
for (t[i] = max(t[i], v); i > 1; i /= 2)
t[i / 2] = max(t[i], t[i ^ 1]);
}
};
void solve() {
int n, m;
cin >> n >> m;
vl a(n);
for (ll &x : a)
cin >> x;
vector<Query> qs(m);
for (int i = 0; i < m; i++) {
cin >> qs[i].l >> qs[i].r >> qs[i].k;
qs[i].idx = i;
qs[i].l--, qs[i].r--;
}
sort(all(qs));
reverse(all(qs));
ST st(n + 10);
vb ans(m);
int idx = n;
vi s;
for (Query q : qs) {
while (q.l < idx) {
idx--;
while (s.size() && a[idx] > a[s.back()]) {
st.upd(s.back(), a[s.back()] + a[idx]);
s.pop_back();
}
while (s.size() && a[idx] == a[s.back()])
s.pop_back();
s.push_back(idx);
}
ans[q.idx] = st.query(0, q.r + 1) <= q.k;
}
for (int i = 0; i < m; i++)
cout << ans[i] << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
clock_t start = clock();
int test_cases = 1;
// cin >> test_cases;
while (test_cases--)
solve();
#ifdef DEBUG
cerr << fixed << setprecision(10)
<< "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
<< "s\n";
#endif
return 0;
}
