#ifdef t9unkubj
#include"debug.cpp"
//#include"template_no_debug.h"
#else 
#define dbg(...) 199958
#endif

#undef _GLIBCXX_DEBUG
#pragma GCC optimize("O3")
using namespace std;
#include<bits/stdc++.h>
using ll=long long;
using ull=unsigned long long;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll i=(n);i>=(m);i--)
#define drep(i,n) for(ll i=((n)-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
template<class T,class F>
bool chmin(T &x, F y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template<class T, class F>
bool chmax(T &x, F y){
    if(x<y){
        x=y;
        return true;
    }
    return false;
}
double pass_time=0;
void solve(){
    int n,q;
    cin>>n>>q;
    vc<int>a(n);
    rep(i,n)cin>>a[i];
    int N=1e5+100;
    vvc<int>is(N);
    rep(i,n){
        for(int j=1;j*j<=a[i];j++){
            if(a[i]%j==0){
                is[j].push_back(i);
                if(j*j!=a[i])is[a[i]/j].push_back(i);
            }
        }
    }
    while(q--){
        int l,r,k;
        cin>>l>>r>>k;
        --l,--r;
        auto it1=lower_bound(all(is[k]),l)-is[k].begin();
        auto it2=upper_bound(all(is[k]),r)-is[k].begin();
        cout<<it2-it1<<"\n";
    }
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    pass_time=clock();
    int t=1;
    //cin>>t;
    while(t--)solve();
    pass_time=clock()-pass_time;
    dbg(pass_time/CLOCKS_PER_SEC);
}