#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 100005
#define M 350 
#define int long long
#define ui unsigned
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define mem(x) memset(x,0,sizeof(x));
using namespace std;
int T,n,m,k,a[N],ans,op,x,y,z;
int id[N],l[M],r[M],sz=317;
int sum[M][N],cnt[M][N];
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("lixian.in","r",stdin);freopen("lixian.out","w",stdout); 
	ios::sync_with_stdio(0);
	cin.tie(0);
	n=read();m=read();
	fo(i,1,n)a[i]=read();
	fo(i,1,n)id[i]=(i-1)/sz+1;
	fo(i,1,id[n])l[i]=r[i-1]+1,r[i]=min(i*sz,n);
	fo(k,1,sz)
		fo(i,1,n)
			sum[k][i]=sum[k][i-1]+a[i]/k;
	fo(i,1,n)cnt[id[i]][a[i]]++;
	fo(i,1,id[n])
		fo(j,1,100000)
			cnt[i][j]+=cnt[i-1][j]; 
	while(m--){
		x=read();y=read();k=read();
		if(k<=sz){printf("%lld\n",sum[k][y]-sum[k][x-1]);continue;}
		ans=0;
		while(x<=y&&x!=l[id[x]])ans+=a[x++]/k;
		while(x<=y&&y!=r[id[y]])ans+=a[y--]/k;
		if(x>y){printf("%lld\n",ans);continue;}
		for(int d=1;d*k<=100000;d++)
			ans+=d*(cnt[id[y]][min(k*(d+1)-1,100000)]-cnt[id[y]][k*d-1]
				   -cnt[id[x]-1][min(k*(d+1)-1,100000)]+cnt[id[x]-1][k*d-1]);
		printf("%lld\n",ans);
	}
	return 0;
}