from bisect import bisect_left, bisect_right
from collections import defaultdict

def divisor(n):
    ans = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            ans.append(i)
            if i*i != n:
                ans.append(n//i)
    return sorted(ans)

N, Q = map(int, input().split())
A = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]

D = defaultdict(list)
for i in range(N):
    div = divisor(A[i])
    for d in div:
        D[d].append(i)

for l, r, k in query:
    if k in D:
        l, r = l-1, r-1
        print(bisect_right(D[k], r)-bisect_left(D[k], l))
    else:
        print(0)