#include<bits/stdc++.h>
using namespace std;
#define esq(x) x << 1
#define dir(x) (x<<1) | 1
#define mid(x,y,t) ((x+y)>>1) + t
typedef long long ll;
const int MAXN = 1e6 + 10;
ll seg[4*MAXN];
struct inter
{
int l, id;
ll k;
};
std::vector<inter> queries[MAXN];
void update(int node, int x, int y, int id, ll v){
if(x > id || y < id) return;
if(x == y){
seg[node] = max(seg[node], v);
return;
}
update(esq(node), x, mid(x,y,0), id, v);
update(dir(node), mid(x,y,1), y, id, v);
seg[node] = max(seg[esq(node)], seg[dir(node)]);
}
ll query(int node, int x, int y, int l, int r){
if(x > r || y < l) return 0;
if(x >= l && y <= r) return seg[node];
ll e = query(esq(node), x, mid(x,y,0), l, r);
ll d = query(dir(node), mid(x,y,1), y, l, r);
return max (e,d);
}
ll b[MAXN];
int ans[MAXN];
int n, m;
int main(){
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++) scanf("%lld", &b[i]);
for(int i = 1; i <= m; i++){
int l, r;
ll k;
scanf("%d %d %lld", &l, &r, &k);
queries[r].push_back({l,i,k});
}
vector<int> stac;
for(int i = 1; i <= n; i++){
while(!stac.empty() && b[stac.back()] <= b[i]) stac.pop_back();
if(!stac.empty()) update(1, 1, n, stac.back(), b[stac.back()] + b[i]);
for(int j = 0; j < queries[i].size(); j++){
inter aqui = queries[i][j];
ans[aqui.id] = (query(1,1,n, aqui.l + 1, i) <= aqui.k);
}
stac.push_back(i);
}
for(int i = 1; i <= m; i++) printf("%d\n", ans[i]);
}
