#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e6;
struct Query { int l, r, k; };
int N, M, A[MAXN+10];
Query B[MAXN+10];
int ans[MAXN+10];
vector<int> tree[MAXN*4+10];
int tree2[MAXN*4+10];
vector<pii> todo[MAXN*4+10];
void init(int node, int tl, int tr)
{
if(tl==tr)
{
tree[node].push_back(A[tl]);
tree2[node]=0;
return;
}
int mid=tl+tr>>1;
init(node*2, tl, mid);
init(node*2+1, mid+1, tr);
tree[node].resize(tree[node*2].size()+tree[node*2+1].size());
merge(tree[node*2].begin(), tree[node*2].end(), tree[node*2+1].begin(), tree[node*2+1].end(), tree[node].begin());
auto it=lower_bound(tree[node*2+1].begin(), tree[node*2+1].end(), tree[node*2].back());
if(it!=tree[node*2+1].begin()) tree2[node]=*(--it)+tree[node*2].back();
tree2[node]=max({tree2[node], tree2[node*2], tree2[node*2+1]});
}
void query(int node, int tl, int tr, int l, int r, vector<int> &V)
{
if(r<tl || tr<l) return;
if(l<=tl && tr<=r)
{
V.push_back(node);
return;
}
int mid=tl+tr>>1;
query(node*2, tl, mid, l, r, V);
query(node*2+1, mid+1, tr, l, r, V);
}
void solve(int node, int tl, int tr)
{
int i, j;
sort(todo[node].begin(), todo[node].end(), greater<pii>());
i=tree[node].size()-1;
for(auto it : todo[node])
{
for(; i>=0 && tree[node][i]>=it.first; i--);
if(i>=0) ans[it.second]=max(ans[it.second], it.first+tree[node][i]);
}
if(tl==tr) return;
int mid=tl+tr>>1;
solve(node*2, tl, mid);
solve(node*2+1, mid+1, tr);
}
int main()
{
int i, j;
scanf("%d%d", &N, &M);
for(i=1; i<=N; i++) scanf("%d", &A[i]);
for(i=1; i<=M; i++) scanf("%d%d%d", &B[i].l, &B[i].r, &B[i].k);
init(1, 1, N);
for(i=1; i<=M; i++)
{
vector<int> V;
query(1, 1, N, B[i].l, B[i].r, V);
int val=0;
for(auto it : V)
{
ans[i]=max(ans[i], tree2[it]);
todo[it].push_back({val, i});
val=max(val, tree[it].back());
}
}
solve(1, 1, N);
for(i=1; i<=M; i++) printf("%d\n", ans[i]<=B[i].k);
}
