#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define int long long
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
if(a>b) swap(a,b);
if(a==0) return a+b;
return gcd(b%a,a);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
bool is_prime(ll n){
ll k=sqrt(n);
if(n==2) return true;
if(n<2||n%2==0||k*k==n) return false;
for(int i=3;i<=k;i+=2){
if(n%i==0){
return false;
}
}
return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,q,arr[mxn],l,r,k,color[mxn];
int res(){
multiset<int>st;
for(int i=l;i<=r;i++){
st.insert(arr[i]);
}
for(int i=l;i<r;i++){
st.erase(st.find(arr[i]));
auto it=st.upper_bound(arr[i]);
if(it!=st.begin()){
it--;
int x=*it;
if(x+arr[i]>k){
return 0;
}
}
}
return 1;
}
void solve2(){
while(q--){
cin>>l>>r>>k;
cout<<res()<<endl;
}
}
void solve(){
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
if(n<=5000){
solve2();
}
int x=0;
for(int i=1;i<=n;i++){
if(arr[i-1]>arr[i]){
color[i]=++x;
}
else{
color[i]=x;
}
}
while(q--){
cin>>l>>r>>k;
if(color[l]==color[r]){
cout<<1<<endl;
}
else{
cout<<0<<endl;
}
}
}
int main(){
IOS;
//cin>>t;
while(t--){
solve();
}
return 0;
}
Compilation message
cc1plus: error: '::main' must return 'int'
