#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fu(x,a,b) for (auto x=a;x<=b;x++)
#define fd(x,a,b) for (auto x=a;x>=b;x--)
#define int ll
using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
/*
Competitive Programming notes that I need to study & fix my dumbass self:
1. Coding:
- Always be sure to check the memory of arrays (maybe use vectors), for loops
- Always try to maximize the memory if possible, even if you are going for subtasks
- Do not exploit #define int long long, it will kill you
2. Stress:
- Always try generating big testcases and try if they run
3. Time management:
- Don't overcommit or undercommit, always spend a certain amount of time to think a problem, don't just look at it and say I'm fucked
- Do not spend too much time coding brute-force solutions, they should be easily-codable solutions that don't take up too much time
Time management schedule:
Offline / LAH days (4 problems - 3h):
15' thinking of solution / idea
1. no idea: skip
2. yes idea: continue thinking for <= 15'
+ implementing: <= 20'
+ brute-force: <= 5'
+ test generator: <= 5'
I hate offline because I am dumb
*/
typedef pair<int, int> ii;
const int N = 2e5+5;
const int B = 750;
const int mod = 1e9+7;
const int inf = 1e18;
using cd = complex<double>;
const long double PI = acos(-1);
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;}
int n,q;
int a[N], b[N];
int calc(int x, int t)
{
int l = 0, r = n, res = n+1;
while (l <= r)
{
int mid = l+r>>1;
int pos = ((int) (t/b[mid])) * a[mid] - mid;
if (pos <= x) r = mid-1, res = mid;
else l = mid+1;
}
// cout<<x<<" "<<t<<" "<<res<<endl;
return n-res+1;
}
void solve()
{
cin>>n>>q;
a[0] = 1, b[0] = 1;
for (int i = 1; i <= n; i++)
{
cin>>a[i];
if (a[i] <= a[i-1]) a[i] = a[i-1], b[i] = b[i-1];
else b[i] = ((a[i]-1)/a[i-1]+1) * b[i-1], a[i] = ((a[i]-1)/a[i-1]+1) * a[i-1];
}
// for (int i = 1; i <= n; i++) cout<<a[i]<<" "<<b[i]<<endl;
while (q--)
{
int t,l,r;
cin>>t>>l>>r;
cout<<calc(r, t) - calc(l-1, t)<<endl;
}
}
/*
Go through the mistakes you usually make and revise your code, for god's sake...
*/
signed main()
{
bruh
//freopen("input.inp","r",stdin);
//freopen("output.inp","w",stdout);
int t = 1;
// cin>>t;
while (t--)
{
solve();
cout<<"\n";
}
}
