#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N = 1e6+100;
int n, q, a[N], t[N * 4], t2[N * 4];
vector < int > g[N * 4];
void build(int v, int l, int r){
if(l == r){
t[v] = a[l];
g[v].pb(a[l]);
return;
}
int m = (l + r) / 2;
build(v + v, l, m);
build(v + v + 1, m + 1, r);
int i = 0, j = 0;
while(i < g[v + v].size() || j < g[v + v + 1].size()){
if(i == g[v + v].size()) g[v].pb(g[v + v + 1][j++]);
else if(j == g[v + v + 1].size()) g[v].pb(g[v + v][i++]);
else{
if(g[v + v][i] < g[v + v + 1][j]) g[v].pb(g[v + v][i++]);
else g[v].pb(g[v + v + 1][j++]);
}
}
t2[v] = max(t2[v + v], t2[v + v + 1]);
t[v] = g[v].back();
for(int i = g[v + v + 1].size() - 1; i >= 0; i--){
if(t[v + v] > g[v + v + 1][i]){
t2[v] = max(t2[v], t[v + v] + g[v + v + 1][i]);
return;
}
}
}
vector < int > h;
void get(int v, int l, int r, int ll, int rr){
if(ll <= l && r <= rr){
h.pb(v);
return;
}
if(l > rr || ll > r) return;
int m = (l + r) / 2;
get(v + v, l, m, ll, rr);
get(v + v + 1, m + 1, r, ll, rr);
}
void solve(){
cin >> n >> q;
for(int i = 1; i <= n; i++) cin >> a[i];
build(1, 1, n);
int l, r, k, ans, mx, ll, rr, cnt, m;
while(q--){
cin >> l >> r >> k;
if(l == r){
cout << 1 << '\n';
continue;
}
get(1, 1, n, l, r);
ans=0, mx = t[h[0]];
for(auto to : h) ans = max(ans, t2[to]);
for(int i = 1; i < h.size() - 1; i++){
for(int j = i; j < h.size(); j++){
ll = 0, rr = g[h[j]].size() - 1, cnt = -mx;
while(ll <= rr){
m = (ll + rr) / 2;
if(mx > g[h[j]][m]){
cnt = g[h[j]][m];
ll = m + 1;
}
else rr = m - 1;
}
ans = max(ans, mx + cnt);
}
mx = max(mx, t[h[i]]);
}
if(ans <= k) cout << 1 << '\n';
else cout << 0 << '\n';
h.clear();
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int tt=1;
// cin >> tt;
while(tt--){
solve();
}
}
