#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

int main(){
   
	int N,Q;
	cin>>N>>Q;
	vector<int> a(N);
	rep(i,N)cin>>a[i];
	int B = 600;
	vector<int> l(Q),r(Q),k(Q);
	rep(i,Q)cin>>l[i]>>r[i]>>k[i];
	vector<int> ans(Q);
	for(int i=1;i<=B;i++){
		vector<int> s(N+1);
		rep(j,N){
			if(a[j]%i==0)s[j+1] = 1;
			s[j+1] += s[j];
		}
		rep(j,Q){
			if(k[j]==i){
				ans[j] = s[r[j]]-s[l[j]-1];
			}
		}
	}
	
	vector<vector<int>> pos(100001);
	rep(i,N)pos[a[i]].push_back(i+1);
	
	rep(i,Q){
		if(k[i]>B){
			for(int j=k[i];j<=100000;j+=k[i]){
				int lpos = lower_bound(pos[j].begin(),pos[j].end(),l[i])-pos[j].begin();
				int rpos = upper_bound(pos[j].begin(),pos[j].end(),r[i])-pos[j].begin();
				ans[i] += rpos-lpos;
			}
			
		}
	}
	rep(i,Q){
		cout<<ans[i]<<endl;
	}
   
	return 0;
}