/*#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")*/
#include <bits/stdc++.h>
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
//#define file(data) freopen(data".in", "r", stdin); freopen(data".out", "w", stdout);
#define pb push_back
//#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(data) data.begin() , data.end()
#define endl '\n'
//freopen("nenokku_easy.in", "r", stdin);
//freopen("nenokku_easy.out", "w", stdout);
#define int long long
#define pii pair < int, int >
#define pll pair < long long, long long >
using namespace std;
typedef long long ll;
const int N = 1e6 + 5;
const int M = 5005;
const int mod = 1e9 + 7;
int n, m, w[N];
pii mt[4 * N];
vector < int > t[4 * N];
pii combine(pii x, pii y) {
if(x.first >= y.first) return x;
else return y;
}
void build(int v, int l, int r) {
if(l == r) {
mt[v] = {w[l], l};
t[v].pb(w[l]);
t[v].pb(mod);
return;
}
int md = (l + r) / 2;
build(v * 2, l, md);
build(v * 2 + 1, md + 1, r);
mt[v] = combine(mt[v * 2], mt[v * 2 + 1]);
merge(all(t[v * 2]), all(t[v * 2 + 1]), back_inserter(t[v]));
}
pii get(int v, int l, int r, int tl, int tr) {
if(tl <= l && r <= tr) {
return mt[v];
}
if(r < tl || tr < l) return {-1, -1};
int md = (l + r) / 2;
return combine(get(v * 2, l, md, tl ,tr), get(v * 2 + 1, md + 1, r, tl, tr));
}
int get2(int v, int l, int r, int tl, int tr, int x) {
if(l > r) return -1;
if(tl <= l && r <= tr) {
int pos = lower_bound(all(t[v]), x) - t[v].begin();
if(pos == 0) return -1;
return t[v][pos - 1];
}
if(r < tl || tr < l) return -1;
int md = (l + r) / 2;
return max(get2(v * 2, l, md, tl, tr, x),
get2(v * 2 + 1, md + 1, r, tl, tr, x));
}
main() {
//file("pieaters");
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> w[i];
}
if(n <= 5000 && m <= 5000) {
while(m--) {
int l, r, k;
cin >> l >> r >> k;
bool ok = 1;
int mx = 0;
for(int j = l; j <= r; j++) {
if(mx + w[j] > k && mx > w[j]) {
ok = 0;
break;
}
mx = max(mx, w[j]);
}
cout << ok << endl;
}
} else {
build(1, 1, n);
while(m--) {
int l, r, k;
cin >> l >> r >> k;
bool ok = 1;
pii gt = get(1, 1, n, l, r);
int gt2 = get2(1, 1, n, gt.second + 1, r, gt.first);
if(gt.first + gt2 > k) ok = 0;
cout << ok << endl;
}
}
}
