# 約数列挙とmultisetではTLE
# 約数列挙とbisect

def divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

N, Q = map(int, input().split())
A = list(map(int, input().split()))

multiple_list = [[] for i in range(10**5+1)]

for i in range(N):
    divs = divisors(A[i])
    for d in divs:
        multiple_list[d].append(i+1)

from bisect import bisect_left, bisect_right

for q in range(Q):
    l, r, k = map(int, input().split())
    upper = bisect_left(multiple_list[k], r+1)
    lower = bisect_left(multiple_list[k], l)
    ans = upper-lower
    print(ans)
    #print('upper', upper, 'lower', lower)