#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int inf = 1e17,N = 2e6+1,MOD = 1e9+7,BL = 1000;
struct FT {
int n;
vi bit;
FT(int nn) {
n = nn;
bit.assign(n+1,0);
}
void put(int p,int v) {
p = n-p+1;
for (int i = p;i<=n;i+=i&-i) bit[i] = max(bit[i],v);
}
int get(int p) {
p = n-p+1;
int ans = 0;
for (int i = p;i>0;i-=i&-i) ans = max(ans,bit[i]);
return ans;
}
};
void solve() {
int n,q;
cin >> n >> q;
vi a(n+1);
for (int i=1;i<=n;i++) {
cin >> a[i];
}
vi ans(q+1);
vector<pair<pii,int>> qs[n+1];
for (int i=1;i<=q;i++) {
int l,r,k;
cin >> l >> r >> k;
qs[r].push_back({{l,k},i});
}
FT ft(n);
stack<pii> stk;
for (int i=1;i<=n;i++) {
while (!stk.empty() && stk.top().ff <= a[i]) stk.pop();
if (!stk.empty()) ft.put(stk.top().ss,a[i]+stk.top().ff);
stk.push({a[i],i});
for (auto it : qs[i]) {
ans[it.ss] = (ft.get(it.ff.ff) <= it.ff.ss);
}
}
for (int i=1;i<=q;i++) cout << ans[i] << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Dodi
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
