import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from bisect import bisect_left

mx=10**5
n,q=LI()
aa=LI()
s=round(mx**0.5)
cs=[[]]
for k in range(1,s):
    cur=[0]
    for a in aa:
        cur.append(cur[-1]+(a%k==0))
    cs.append(cur)
a2i=[[] for _ in range(mx+1)]
for i,a in enumerate(aa):a2i[a].append(i)
for a in aa:a2i[a].sort()

for _ in range(q):
    l,r,k=LI()
    l-=1
    ans=0
    if k<s:
        ans=cs[k][r]-cs[k][l]
    else:
        for a in range(k,mx+1,k):
            i=bisect_left(a2i[a],l)
            j=bisect_left(a2i[a],r)
            ans+=j-i
    print(ans)