#include<bits/stdc++.h>
using namespace std;
using ll=long long;

vector<ll> calc_divisors(ll N) {
    vector<ll> res;
    for (ll i = 1; i * i <= N; ++i) {
        if (N % i != 0) continue;
        res.push_back(i);
        if (N / i != i) res.push_back(N / i);
    }
    sort(res.begin(), res.end());
    return res;
}

int main(){
  ll n,q;
  cin>>n>>q;
  vector<ll> a(n);
  for(ll i=0;i<n;i++){
    cin>>a[i];
  }
  map<ll,vector<ll>> mp;
  for(ll i=0;i<n;i++){
    vector<ll> d=calc_divisors(a[i]);
    for(ll j:d){
      mp[j].push_back(i);
    }
  }
  while(q--){
    ll l,r,k;
    cin>>l>>r>>k;
    l--;
    r--;
    ll cnt=upper_bound(mp[k].begin(),mp[k].end(),r)-lower_bound(mp[k].begin(),mp[k].end(),l);
    cout<<cnt<<endl;
  }
}