#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
ll move_len[500001];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n,q;
cin >> n >> q;
move_len[0] = 1;
rep2(i,1,n)
{
ll d;
cin >> d;
move_len[i] = min((ll)(1e9+10),move_len[i-1]*((move_len[i-1]+d-1)/move_len[i-1]));
}
rep(qq,q)
{
ll l2,r2,t;
cin >> t >> l2 >> r2;
int l = 0;
int r = n;
int f = n+1;
while(l <= r)
{
int mid = (l+r)/2;
ll p = move_len[mid]*(t/move_len[mid])-mid;
if(p <= r2)
{
f = mid;
r = mid-1;
}
else
{
l = mid+1;
}
}
l = 0;
r = n;
int f2 = n+1;
while(l <= r)
{
int mid = (l+r)/2;
ll p = move_len[mid]*(t/move_len[mid])-mid;
if(p < l2)
{
f2 = mid;
r = mid-1;
}
else
{
l = mid+1;
}
}
cout << f2-f << "\n";
}
}
