#include<bits/stdc++.h>
#define el '\n'
using namespace std ;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
const int MN = 1e6 + 5;
const int N = 2e5 + 5;
const int inf = 2e9;
int n , m , a[MN];
namespace sub_trau{
bool valid_input(){
return n <= 500 && m <= 500;
}
void solve(){
while(m--){
int l , r , k;
cin >> l >> r >> k;
int ans = 0;
for ( int i = l ; i <= r ; i++ ){
for ( int j = i ; j <= r ; j++ ){
if (a[j] < a[i]) ans = max(ans , a[j] + a[i]);
}
}
cout << (ans <= k ? 1 : 0) << el;
}
}
}
namespace sub2{
bool valid_input(){
return n <= 5000 && m <= 5000;
}
void solve(){
while(m--){
int l , r , k;
cin >> l >> r >> k;
int ans = 0;
vector<int> pref(r + 3);
pref[l - 1] = INT_MIN;
pref[l] = a[l];
for ( int i = l + 1 ; i <= r ; i++ ) pref[i] = max(pref[i - 1] , a[i]);
for ( int i = l ; i <= r ; i++ ){
if (pref[i - 1] > a[i]) ans = max(ans , a[i] + pref[i - 1]);
}
cout << (ans <= k ? 1 : 0) << el;
}
}
}
namespace memory_dak{
bool valid_input(){
return n <= (int)2e5 && m <= (int)2e5;
}
struct merge_sort_tree{
#define lt(x) (x << 1)
#define rt(x) (x << 1 | 1)
vector<int> st[4 * MN];
void build(int id , int l , int r){
if (l == r){
st[id].push_back(a[l]);
return;
}
int mid = l + r >> 1;
build(id << 1 , l , mid);
build(id << 1 | 1 , mid + 1 , r);
merge(st[lt(id)].begin() , st[lt(id)].end() , st[rt(id)].begin() , st[rt(id)].end() , back_inserter(st[id]));
}
int get(int id , int l , int r , int tl , int tr , int x){
if (l > tr || r < tl) return -inf;
else if (l >= tl && r <= tr){
auto it = lower_bound(st[id].begin() , st[id].end() , x) - st[id].begin() - 1;
if (it >= 0) return st[id][it];
else return -inf;
}
int mid = l + r >> 1;
return max(get(id << 1 , l , mid , tl , tr , x) , get(id << 1 | 1 , mid + 1 , r , tl , tr , x));
}
} mt;
struct Segtri{
struct Node{
int l , r , best , max_val;
};
Node merge(const Node &x , const Node &y){
Node c;
c.l = x.l;
c.r = y.r;
c.max_val = max(x.max_val , y.max_val);
c.best = max(x.best , y.best);
int cur = mt.get(1 , 1 , n , y.l , y.r , x.max_val);
c.best = max(c.best , x.max_val + cur);
return c;
}
Node st[4 * N];
void build(int id , int l , int r){
if (l == r){
st[id] = {l , l , 0 , a[l]};
return;
}
int mid = l + r >> 1;
build(id << 1 , l , mid);
build(id << 1 | 1 , mid + 1 , r);
st[id] = merge(st[id << 1] , st[id << 1 | 1]);
}
Node get(int id , int l , int r , int tl , int tr){
if (l >= tl && r <= tr) return st[id];
else {
int mid = l + r >> 1;
if (tl > mid) return get(id << 1 | 1 , mid + 1 , r , tl , tr);
else if (tr <= mid) return get(id << 1 , l , mid , tl , tr);
else return merge(get(id << 1 , l , mid , tl , tr) , get(id << 1 | 1 , mid + 1 , r , tl , tr));
}
}
};
void solve(){
mt.build(1 , 1 , n);
Segtri it;
it.build(1 , 1 , n);
while(m--){
int l , r , k;
cin >> l >> r >> k;
cout << (it.get(1 , 1 , n , l , r).best <= k ? 1 : 0) << el;
}
}
}
namespace sub_final{
vector<tuple<int , int , int>> queries[MN];
struct fenwick{
int bit[MN];
void update(int p , int v){
for ( ; p ; p -= p & -p ){
bit[p] = max(bit[p] , v);
}
}
int get(int x){
int res = 0;
for ( ; x <= n ; x += x & -x ){
res = max(res , bit[x]);
}
return res;
}
} fw;
void solve(){
stack<int> st;
for ( int i = 1 ; i <= m ; i++ ){
int l , r , k;
cin >> l >> r >> k;
queries[r].push_back(make_tuple(l , k , i));
}
a[0] = inf;
st.push(0);
vector<int> ans(m + 5);
for ( int i = 1 ; i <= n ; i++ ){
while (!st.empty() && a[st.top()] <= a[i]) st.pop();
if (st.top()) fw.update(st.top() , a[st.top()] + a[i]);
st.push(i);
for ( auto [l , k , id] : queries[i] ){
ans[id] = fw.get(l) <= k;
}
}
for ( int i = 1 ; i <= m ; i++ ) cout << ans[i] << el;
}
}
int32_t main (){
// freopen("sortbook.inp" , "r" , stdin);
// freopen("sortbook.out" , "w" , stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for ( int i = 1 ; i <= n ; i++ ) cin >> a[i];
if (sub_trau::valid_input()){
sub_trau::solve();
return 0;
}
if (sub2::valid_input()){
sub2::solve();
return 0;
}
if (memory_dak::valid_input()){
memory_dak::solve();
return 0;
}
sub_final::solve();
}
