#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;
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;
}
}
}
int32_t main (){
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;
}
}
