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

typedef long long ll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    const int B = 350;
    const int M = 101010;

    int N, Q; cin >> N >> Q;
    vector<int> A(N);
    rep(i, N) cin >> A[i];

    vector cnt(B + 1, vector<int>(N + 1));
    FOR(v, 1, B + 1)rep(i, N){
        cnt[v][i + 1] = cnt[v][i];
        if((A[i] % v) == 0) cnt[v][i + 1]++;
    }

    vector<vector<int>> indices(M);
    rep(i, N){
        int v = A[i];
        if(v <= B) continue;
        while(v < M){
            indices[v].push_back(i);
            v += A[i];
        }
    }
    while(Q--){
        int L, R, K; cin >> L >> R >> K;
        L--;
        if(K <= B){
            cout << cnt[K][R] - cnt[K][L] << endl;
        }
        else{
            cout << (int)(lower_bound(all(indices[K]), R) - lower_bound(all(indices[K]), L)) << endl;
        }
    }
}