n,q=map(int,input().split())
a=list(map(int,input().split()))
f={}
for i in range(n):
  v=a[i]
  j=1
  while j*j<=v:
    if v%j==0:
      if j not in f:
        f[j]=[]
      f[j]+=[i]
      if v//j!=j:
        if v//j not in f:
          f[v//j]=[]
        f[v//j]+=[i]
    j+=1
for v in f:
  f[v].sort()
from bisect import bisect_left,bisect_right
for _ in range(q):
  l,r,k=map(int,input().split())
  l-=1
  r-=1
  if k not in f:
    print(0)
    continue
  print(bisect_right(f[k],r)-bisect_left(f[k],l))