#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

// Sieve of Eratosthenes
// https://youtu.be/UTVg7wzMWQc?t=2774
struct Sieve {
  int n;
  vector<int> f, primes;
  Sieve(int n=1):n(n), f(n+1) {
    f[0] = f[1] = -1;
    for (ll i = 2; i <= n; ++i) {
      if (f[i]) continue;
      primes.push_back(i);
      f[i] = i;
      for (ll j = i*i; j <= n; j += i) {
        if (!f[j]) f[j] = i;
      }
    }
  }
	vector<long long> enum_divisors(long long x){
		vector<long long> res;
		for(long long i = 1; i <= n; i++){
			if(x % i == 0){
				long long square = i * i;
				if(x > square){
					res.push_back(i);
					res.push_back(x / i);
				}else if(x == square){
					res.push_back(i);
				}else break;
			}
		}
		return res;
	}
};

const int M = 100000;

int main(){
	int n, q;
	cin >> n >> q;
	vector<int> a(n);
	cin >> a;
	Sieve sieve(330);
	vector<vector<int>> cnt(M + 1);
	rep(i, n){
		auto divisors = sieve.enum_divisors(a[i]);
		for(int x : divisors){
			cnt[x].push_back(i);
		}
	}
	rep(i, q){
		int l, r, k;
		cin >> l >> r >> k;
		l--; r--;
		int li = lower_bound(cnt[k].begin(), cnt[k].end(), l) - cnt[k].begin();
		int ri = prev(upper_bound(cnt[k].begin(), cnt[k].end(), r)) - cnt[k].begin();
		cout << ri - li + 1 << "\n";
	}
	return 0;
}