N,Q=map(int,input().split())
A=list(map(int,input().split()))
G=[[] for i in range(10**5+1)]
from math import sqrt
for i in range(N):
  x=A[i]
  B=set()
  k=int(sqrt(x))
  for y in range(1,k+1):
    if x%y==0:
      B.add(x//y)
      B.add(y)
  for y in B:
    G[y].append(i)
from bisect import bisect_right
for i in range(Q):
  l,r,K=map(int,input().split())
  result=bisect_right(G[K],r-1)-bisect_right(G[K],l-2)
  print(result)