/*input
5 2
3 5 1 8 2
1 3 6
2 5 3
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,ll>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e6+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=INF64;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
return (a*b)%MOD;
}
ll mypow(ll a,ll b){
if(b<=0) return 1;
ll res=1LL;
while(b){
if(b&1) res=mult(res,a);
a=mult(a,a);
b>>=1;
}
return res;
}
int bit[maxn],arr[maxn],ans[maxn];
vector<pair<pii,int>> qq[maxn];
void upd(int p,int x){
++p;
while(p<maxn){
MXTO(bit[p],x);
p+=lowb(p);
}
}
int query(int p){
++p;
int ans=0;
while(p){
MXTO(ans,bit[p]);
p-=lowb(p);
}
return ans;
}
int main(){
ios::sync_with_stdio(false),cin.tie(0);
int n,q;
cin>>n>>q;
vector<int> v;
vector<pii> inv;
REP(i,n){
cin>>arr[i];
while(sz(v) and arr[v.back()]<=arr[i]) v.pop_back();
if(sz(v)) inv.pb({v.back(),i});
v.pb(i);
}
sort(ALL(inv));
REP(i,q){
int l,r,k;
cin>>l>>r>>k;
--l,--r;
qq[l].pb({{r,k},i});
}
for(int i=n-1;i>=0;i--){
while(sz(inv) and inv.back().f>=i){
int l=inv.back().f,r=inv.back().s;
upd(r,arr[l]+arr[r]);
inv.pop_back();
}
for(auto x:qq[i]){
ans[x.s]=query(x.f.f)<=x.f.s;
}
}
REP(i,q) cout<<ans[i]<<'\n';
}
