#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
#define int long long
#define mid (l+r)/2
const int inf = 1e18;
struct node {
int answer;
vector < int > v;
int smaller(int x){
auto it = (lower_bound(v.begin(),v.end(),x));
if(it == v.begin() or v.size() == 0)return -inf;
else return *(--it);
}
};
node merge(node a , node b){
node product;
product.answer = max({a.answer , b.answer , a.smaller(1e18) + b.smaller(a.smaller(1e18))});
for(auto itr : a.v){
product.v.push_back(itr);
}
for(auto itr : b.v){
product.v.push_back(itr);
}
sort(product.v.begin() , product.v.end());
return product;
}
node etkisiz;
struct SEGMENT_TREE {
node tree[4*N];
node _query(int ind , int l , int r , int ql , int qr){
if(l >= ql and r <= qr)return tree[ind];
else if(l > qr or r < ql)return etkisiz;
return merge(_query(ind*2,l,mid,ql,qr) , _query(ind*2+1,mid+1,r,ql,qr));
}
int query(int l , int r){
return _query(1,1,N,l,r).answer;
}
void _update(int ind , int l, int r , int pos , int val){
if(l == r){
tree[ind].answer = 0;
tree[ind].v = {val};
return;
}
if(pos <= mid)_update(ind*2,l,mid,pos,val);
else _update(ind*2+1,mid+1,r,pos,val);
tree[ind] = merge(tree[ind*2],tree[ind*2+1]);
}
void update(int pos , int val){
_update(1,1,N,pos,val);
}
};
signed main(){
etkisiz.answer = 0;
etkisiz.v = {};
int n,m;cin >> n >> m;
int arr[n];
for(int i = 0;i<n;i++)cin >> arr[i];
SEGMENT_TREE segt;
for(int i = 1;i<=n;i++){
segt.update(i,arr[i-1]);
}
while(m--){
int cl,cr,cw;cin >> cl >> cr >> cw;
cout << ( segt.query(cl,cr) > cw ? 0 : 1 ) << '\n';
}
}
