#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

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

int main () {
    int N, Q; cin >> N >> Q;
    vector<int> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    map<int, vector<int>> acc;

    for (int i = 0; i < N; i++) {
        for (auto d : divisors(A[i])) {
            acc[d].push_back(i);
        }
    }

    for (int i = 0; i < Q; i++) {
        int L, R, K; cin >> L >> R >> K;
        L--, R--;
        auto lit = lower_bound(acc[K].begin(), acc[K].end(), L);
        auto rit = upper_bound(acc[K].begin(), acc[K].end(), R);

        cout << (rit - lit) << "\n";
    }
}