// 23 - 12 - 23
#include<bits/stdc++.h>
using namespace std;
#define read() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define day() time_t now = time(0);char* x = ctime(&now);cerr<<"Right Now Is : "<<x<<"\n"
#define ii pair<int,int>
#define X first
#define Y second
const long long MAX = (int)1e5 + 5;
const long long INF = (int)1e9;
const long long MOD = (int)1e9 + 7;
int n,q;
int a[MAX],last[MAX];
struct node{
int l,i,c;
};
vector<node> qrx[MAX];
int bit[MAX];
void update(int id,int val){
for(;id > 0;id -= id & -id)bit[id] = max(bit[id],val);
}
int get(int id){
int res = 0;
for(;id <= n;id += id & -id)res = max(res,bit[id]);
return res;
}
int res[MAX];
signed main(){
read();
cin >> n >> q;
for(int i = 1;i <= n;i++){
cin >> a[i];
last[i] = i - 1;
while(last[i] && a[i] >= a[last[i]])last[i] = last[last[i]];
}
for(int i = 1,l,r,c;i <= q;i++){
cin >> l >> r >> c;
qrx[r].push_back({l,i,c});
}
for(int i = 1;i <= n;i++){
update(last[i],a[last[i]] + a[i]);
for(auto e : qrx[i])res[e.i] = (get(e.l) <= e.c);
}
for(int i = 1;i <= q;i++)cout << res[i] << '\n';
}
