#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e6 + 2;
const int inf = 2e9;
int st[4 * N];
void Add(int node, int l, int r, int x, int y) {
smax(st[node], y);
if (l == r) return;
int mid = l + r >> 1;
if (x <= mid) Add(2 * node, l, mid, x, y);
else Add(2 * node + 1, mid + 1, r, x, y);
}
int Get(int node, int l, int r, int ql, int qr) {
if (r < ql || qr < l) return 0;
if (ql <= l && r <= qr) return st[node];
int mid = l + r >> 1;
return max(Get(2 * node, l, mid, ql, qr), Get(2 * node + 1, mid + 1, r, ql, qr));
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= 4 * n; i++) st[i] = -inf;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<vector<int>> qq(n);
vector<int> l(m), r(m), x(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i] >> x[i];
l[i] -= 1; r[i] -= 1;
qq[r[i]].push_back(i);
}
vector<int> ans(m);
vector<int> v;
for (int i = 0; i < n; i++) {
while (!v.empty() && a[v.back()] <= a[i]) v.pop_back();
if (!v.empty()) Add(1, 0, n - 1, v.back(), a[v.back()] + a[i]);
for (int j : qq[i]) {
int z = Get(1, 0, n - 1, l[j], i);
if (z <= x[j]) ans[j]++;
}
v.push_back(i);
}
for (int i = 0; i < m; i++) cout << ans[i] << en;
cout << en;
return 0;
}
