#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Sz(x) (int)x.size()
const int N = 1e6 + 5;
const int block = 2;
const int M = N / block + 1;
int n, m, a[N];
int mn[M], mx[M], ans[M], it[M];
vector <int> save[M];
void solve() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i <= n / block; i++) {
int l = max(1ll, i * block), r = min(n, (i + 1) * block - 1);
int Mn = INT_MAX, Mx = INT_MIN;
for (int j = l; j <= r; j++) {
Mn = min(Mn, a[j]);
Mx = max(Mx, a[j]);
save[i].push_back(a[j]);
}
it[i] = Sz(save[i]) - 1;
sort(save[i].begin(), save[i].end());
mn[i] = Mn;
mx[i] = Mx;
Mx = INT_MIN;
int sum = INT_MIN;
for (int j = l; j <= r; j++) {
if (Mx > a[j]) sum = max(sum, Mx + a[j]);
Mx = max(Mx, a[j]);
}
ans[i] = sum;
}
vector <pair<int,int>> seg;
vector <pair<int,pair<int,int>>> Seg;
for (int i = 1; i <= m; i++) {
int l, r, k;
cin >> l >> r >> k;
seg.push_back(mp(l, i));
Seg.push_back(mp(l, mp(r, k)));
}
sort(seg.begin(), seg.end());
vector <int> res(m + 1, 0);
for (auto to : seg) {
int ind = to.se, l = Seg[ind - 1].fi, r = Seg[ind - 1].se.fi, k = Seg[ind - 1].se.se;
int bl = l / block, br = r / block, ok = 1, Mx = INT_MIN;
if (bl == br) {
for (int i = l; i <= r; i++) {
if (Mx > a[i] && a[i] + Mx > k) ok = 0;
Mx = max(Mx, a[i]);
}
}
else {
for (int i = l; i < (bl + 1) * block; i++) {
if (Mx > a[i] && a[i] + Mx > k) ok = 0;
Mx = max(Mx, a[i]);
}
for (int i = bl + 1; i <= br - 1; i++) {
while (it[i] >= 0 && Mx <= save[i][it[i]]) {
it[i]--;
}
if (it[i] >= 0 && Mx > save[i][it[i]] && save[i][it[i]] + Mx > k) {
ok = 0;
}
if (ans[i] > k) ok = 0;
Mx = max(Mx, mx[i]);
}
for (int i = br * block; i <= r; i++) {
if (Mx > a[i] && a[i] + Mx > k) ok = 0;
Mx = max(Mx, a[i]);
}
}
if (ok) res[ind] = 1;
}
for (int i = 1; i <= m; i++) {
cout << res[i] << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
for (int T = 1; T <= t; T++) {
solve();
cout << '\n';
}
}
