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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

// importbisect
template <typename T>
int bisect_left(vector<T> &X, T v){
	return lower_bound(X.begin(), X.end(), v) - X.begin();
}

template <typename T>
int bisect_right(vector<T> &X, T v){
	return upper_bound(X.begin(), X.end(), v) - X.begin();
}
// -----


int main(){
	
	int n, q; cin >> n >> q;
	vector<ll> a(n);
	rep(i,0,n){
		cin >> a[i];
	}

	const int B = 1000;
	vector fw(B+1,vector<int>(n+1));
	rep(i,1,B+1){
		rep(j,0,n){
			if(a[j]%i==0){
				fw[i][j+1]++;
			}
		}
		rep(j,0,n){
			fw[i][j+1] += fw[i][j];
		}
	}

	vector tar(100001, vector<int>(0));
	rep(i,0,n){
		tar[a[i]].push_back(i);
	}

	while(q--){
		int l, r, k; cin >> l >> r >> k;
		l--;
		int ans = 0;
		if (k > B){
			for (int i=k; i<=100000; i+=k){
				ans += bisect_left(tar[i], r);
				ans -= bisect_left(tar[i], l);
			}
		}else{
			ans = fw[k][r] - fw[k][l];
		}
		cout << ans << '\n';
	}



}