#include<bits/stdc++.h>
#include<fstream>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const int base = 74;
const int mxn = 1e6 + 5;
const ll inf = 1e9;
int n, m;
int st[4 * mxn + 1], lz[4 * mxn + 1], a[mxn + 1], to[mxn + 1];
struct Q{
int l, k, id;
};
vt<Q>queries[mxn + 1];
bool ans[mxn + 1];
vt<int>comp;
void upd(int nd, int l, int r, int id, int v){
if(id < l || id > r)return;
if(l == r){
st[nd] = v;return;
}
int mid = (l + r) >> 1;
upd(nd << 1, l, mid, id, v); upd(nd << 1 | 1, mid + 1, r, id, v);
st[nd] = max(st[nd << 1], st[nd << 1 | 1]);
}
int get(int nd, int l, int r, int ql, int qr){
if(ql > r || qr < l)return(0);
if(ql <= l && qr >= r)return(st[nd]);
int mid = (l + r) >> 1;
return(max(get(nd << 1, l, mid, ql, qr), get(nd << 1 | 1, mid + 1, r, ql, qr)));
}
signed main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
forr(i, 1, n + 1)cin >> a[i];
deque<int>dq;
for(int i = 1; i <= n; i++){
while(sz(dq) && a[dq.back()] <= a[i])dq.pop_back();
if(dq.size()){
to[i] = dq.back();
}else{
to[i] = -1;
}
dq.pb(i);
}
for(int i = 0; i < m; i++){
int l, r, k; cin >> l >> r >> k;
queries[r].pb({l, k, i});
}
for(int i = 1; i <= n; i++){
if(to[i] != -1){
upd(1, 1, n, to[i], a[i] + a[to[i]]);
}
for(auto [l, k, id]: queries[i]){
int val = get(1, 1, n, l, i);
ans[id] = (val <= k);
}
}
for(int i = 0; i < m; i++)cout << ans[i] << "\n";
return(0);
}
