//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <bit>
#include <cstdint>

#define rep(i,n) for(ll i = 0; i < n; i++) //[0,n)
#define srep(i,a,b) for(ll i = a; i < b; i++) //[a,b)
#define arep(i,a,b,d) for(ll i = a; i < b; i += d)
#define all(A) (A).begin(),(A).end()
#define rall(A) (A).rbegin(),(A).rend()
#define pmt(A) next_permutation(all(A))
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll,ll>;
using pq = priority_queue<ll,vector<ll>,greater<ll>>;
const ll inf = 1LL<<60;
const int iinf = (int)1e9+1;
const int mod9 = 998244353;
const int mod1 = (int)1e9+7;
struct Edge { int to; long long cost; int from; };
bool compe(const Edge &e,const Edge &e2){ return e.cost < e2.cost; }
using Graph = vector<vector<int>>;
using SGraph = vector<set<ll>>;
template <class T>
int siz(T& a){return (int)a.size();}
ll squa(ll a){ return a*a; }
double torad(double x){ return x*(acos(-1)/180.0); }
ll cross(ll ax,ll ay,ll bx,ll by){ return ax*by-ay*bx; }
ll mceil(ll a,ll b){ return (a+b-1)/b; }

vector<int> divisors(int x){
    vector<int> res;
    for(ll i = 1; i*i <= x; i++){
        if(x%i != 0) continue;
        res.push_back(i);
        if(x/i != i) res.push_back(x/i);
    }
    return res;
}

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

    map<int,vector<int>> mp;
    rep(i,N){
        auto D = divisors(A[i]);
        for(int r : D) mp[r].push_back(i);
    }

    rep(i,Q){
        int L,R,K; cin >> L >> R >> K;
        L--; R--;
        auto cnt = upper_bound(all(mp[K]),R)-lower_bound(all(mp[K]),L);
        cout << cnt << endl;
    }
}