#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct pair_hash{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
const ll INF = 1e9 + 7;
const int MAXN = 5e5 + 7;
ll D[MAXN];
ll X[MAXN];
int n, q;
ll getPos(ll x, ll t){
if(X[x] == INF){
return -x;
}
return (ll)-x + (ll)X[x] * (t / X[x]);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> q;
for(int i = 1; i <= n; i++){
cin >> D[i];
}
X[0] = 1;
for(int i = 1; i <= n; i++){
X[i] = min(INF, (ll)X[i - 1] * ((D[i] + X[i - 1] - 1) / X[i - 1]));
}
while(q--){
ll t, L, R;
cin >> t >> L >> R;
// for(int i = 0; i <= n; i++){
// cout << i << ' ' << getPos(i, t) << '\n';
// }
int l = 0;
int p = n;
int mid;
while(l < p){
mid = (l + p) / 2;
// cerr << l << ' ' << p << ' ' << mid << ' ' << getPos(mid, t) << ' ' << R << '\n';
if(getPos(mid, t) <= R){
p = mid;
}else{
l = mid + 1;
}
}
// cerr << l << '\n';
if(getPos(l, t) < L || getPos(l, t) > R){
cout << "0\n";
continue;
}
int x = l;
l = 0;
p = n;
while(l < p){
mid = (l + p + 1) / 2;
if(getPos(mid, t) >= L){
l = mid;
}else{
p = mid - 1;
}
}
// cerr << l << '\n';
cout << l - x + 1 << '\n';
}
return 0;
}
