#include <iostream>
#include <cstdio>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <limits>
#include <tuple>
#include <stack>
#include <bitset>
#include <cstring>
#include <sstream>
#include <functional>
#include <random>
using namespace std;
using ll = long long;
int n, q;
vector<ll> a;
struct Node {
ll mn, mx, k;
};
vector<Node> seg;
Node merge(const Node& a, const Node& b) {
Node r;
r.k = 0;
r.mn = min(a.mn, b.mn);
r.mx = max(a.mx, b.mx);
if (a.mx > b.mx) {
r.k = a.mx + b.mx;
}
else if (a.mx > b.mn) {
r.k = a.mx + b.mn;
}
else if (a.mn > b.mn) {
r.k = a.mn + b.mn;
}
r.k = max({ r.k, a.k, b.k });
return r;
}
void build(int u, int l, int r) {
if (l == r) {
seg[u].mn = seg[u].mx = a[l];
seg[u].k = 0;
return;
}
int mid = (l + r) / 2;
build(2 * u, l, mid);
build(2 * u + 1, mid + 1, r);
seg[u] = merge(seg[2 * u], seg[2 * u + 1]);
}
Node query(int u, int l, int r, int ql, int qr) {
if (r < ql || l > qr) {
return { LLONG_MAX, LLONG_MIN, LLONG_MIN };
}
if (ql <= l && r <= qr) {
return seg[u];
}
int mid = (l + r) >> 1;
Node L = query(2 * u, l, mid, ql, qr);
Node R = query(2 * u, mid + 1, r, ql, qr);
return merge(L, R);
}
void solve() {
cin >> n >> q;
a.resize(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
seg.resize(4 * n);
build(1, 0, n - 1);
while (q--) {
int l, r;
ll k;
cin >> l >> r >> k;
--l, --r;
Node qr = query(1, 0, n - 1, l, r);
if (k < qr.k) {
cout << "0\n";
}
else {
cout << "1\n";
}
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
