#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define maxn 1000009
#define fi first
#define se second
#define pb push_back
#define left id<<1
#define right id<<1|1
#define re exit(0);
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ;
const int LOG = 18 ;
typedef vector<int> vi ;
typedef pair<int,int> pii ;
typedef vector<ll> vl ;
typedef vector<pii> vii ;
void add ( int &a , int b )
{
a += b ;
if ( a < 0 ) a += mod ;
if ( a >= mod ) a -= mod ;
}
template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
// freopen ("bai1.out","w",stdout) ;
}
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
int n , nq ;
int a [maxn] ;
int le [maxn] ;
int ans [maxn] ;
struct even
{
int l , k , id ;
};
vector <even> event [maxn] ;
int T [maxn*4] ;
void update ( int id , int l , int r , int pos , int w )
{
if ( l > pos || r < pos ) return ;
if ( l == r )
{
T [id] = w ;
return ;
}
int mid = (l+r)/2 ;
update (left,l,mid,pos,w) ; update (right,mid+1,r,pos,w) ;
T [id] = max (T[left],T[right]) ;
}
int get ( int id , int l , int r , int u , int v )
{
if ( l > v || r < u ) return 0 ;
if ( u <= l && r <= v ) return T [id] ;
int mid = (l+r)/2 ;
return max (get(left,l,mid,u,v),get(right,mid+1,r,u,v)) ;
}
int main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0) ;
// rf () ;
cin >> n >> nq ;
for ( int i = 1 ; i <= n ; i ++ )
{
cin >> a [i] ;
}
for ( int i = 1 ; i <= nq ; i ++ )
{
int l , r , k ; cin >> l >> r >> k ;
event [r] . pb ({l,k,i}) ;
}
stack <int> stk ;
for ( int i = 1 ; i <= n ; i ++ )
{
while (!stk.empty()&&a[stk.top()]<=a[i]) stk.pop() ;
le [i] = stk.empty() ? 0 : stk.top() ;
stk.push (i) ;
}
for ( int i = 1 ; i <= n ; i ++ )
{
if ( le [i] ) update (1,1,n,le[i],a[le[i]]+a[i]) ;
for ( auto x : event [i] )
{
int Max = get (1,1,n,x.l,i) ;
ans [x.id] = ( Max <= x.k ) ;
}
}
for ( int i = 1 ; i <= nq ; i ++ ) cout << ans [i] << "\n" ;
}
// range , error , check special , ...
// find key , find key
//'-std=c++11' stay hard
// there is no tomorrow
