#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    int n, q; cin >> n >> q;
    vector<int> a(n);
    for(int i=0; i<n; i++) cin >> a[i];

    int MAX = 1e5;
    vector<vector<int>> pos(MAX+1);
    for(int i=0; i<n; i++){
        for(int j=1; j*j<=a[i]; j++){
            if(a[i]%j != 0) continue;
            pos[j].pb(i);
            if(j!=a[i]/j) pos[a[i]/j].pb(i);
        }
    }

    while(q--){
        int l, r, k; cin >> l >> r >> k;
        l--; r--;
        auto ritr = upper_bound(all(pos[k]), r);
        auto litr = lower_bound(all(pos[k]), l);
        cout << (int)(ritr-litr) << '\n';
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}