#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;
const int MAXN = 1e6 + 10;
int n, m;
int a[MAXN];
int t[MAXN << 2];
vector <pair <int, pii> > q[MAXN];
int ans[MAXN];
void upd(int pos, int val, int v = 1, int tl = 1, int tr = n) {
if(tl == tr) {
t[v] = max(t[v], val);
return;
}
int tm = tl + tr >> 1;
if(pos <= tm) upd(pos, val, v << 1, tl, tm);
else upd(pos, val, v << 1 | 1, tm + 1, tr);
t[v] = max(t[v << 1], t[v << 1 | 1]);
}
int get(int l, int r, int v = 1, int tl = 1, int tr = n) {
if(l <= tl && tr <= r) return t[v];
if(l > tr || r < tl) return 0;
int tm = tl + tr >> 1;
return max(get(l, r, v << 1, tl, tm), get(l, r, v << 1 | 1, tm + 1, tr));
}
void solve() {
cin >> n >> m;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
}
for(int i = 1; i <= m; ++i) {
int l, r, k;
cin >> l >> r >> k;
q[r].pb(mp(l, mp(k, i)));
}
stack <int> st;
for(int i = 1; i <= n; ++i) {
while(!st.empty() && a[st.top()] <= a[i]) st.pop();
if(!st.empty()) upd(st.top(), a[i] + a[st.top()]);
st.push(i);
for(auto it : q[i]) ans[it.s.s] = (get(it.f, i) <= it.s.f);
}
for(int i = 1; i <= m; ++i) cout << ans[i] << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int CNT_TESTS = 1;
///cin >> CNT_TESTS;
for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
solve();
if(NUMCASE != CNT_TESTS) cout << '\n';
}
return 0;
}
