#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define ld long double
#define pb push_back
#define pf push_front
#define mod 998244353
#define se second
#define fi first
#define all(ls) (ls).begin(),(ls).end()
#define int long long
using namespace std;
using namespace __gnu_pbds;
template<typename type>using ordered_set=tree<type,null_type,less<type>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename type>using ordered_multiset=tree<type,null_type,less_equal<type>,rb_tree_tag,tree_order_statistics_node_update>;
bool comp(pair<int,int>a,pair<int,int>b){
if(a.fi==b.fi)
return a.se<b.se;
return a.fi<b.fi;
}
void solve(){
int n,q;
cin>>n>>q;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
vector<pair<int,int>>subs;
int cnt=1;
for(int i=1;i<n;i++){
if(a[i-1]<=a[i])
cnt++;
else{
subs.pb({i-cnt,i-1});
cnt=1;
}
}
subs.pb({(n-1)-cnt+1,n-1});
// for(pair<int,int>i:subs)
// cout<<i.fi<<" "<<i.se<<endl;
// cout<<endl;
sort(all(subs),comp);
while(q--){
int l,r,k;
cin>>l>>r>>k;
l--;r--;
int ans=0;
int low=0,high=subs.size()-1;
while(low<=high){
int mid=(low+high)/2;
if(subs[mid].fi>l)
high=mid-1;
else if(subs[mid].se<r)
low=mid+1;
else{
ans=1;
break;
}
}
cout<<ans<<endl;
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
for(int i=1;i<=t;i++){
// cout<<"Scenario #"<<i<<":"<<" ";
solve();
}
}
