def divisors(n, prime_element):
    divisors = [1]
    while n > 1:
        p = prime_element[n]
        divisors += [d * p for d in divisors]
        n //= p
    return divisors

def lower_bound(arr, x):
    l, r = 0, len(arr)
    while l < r:
        m = (l + r) // 2
        if arr[m] < x:
            l = m + 1
        else:
            r = m
    return l

N, Q = map(int, input().split())
A = list(map(int, input().split()))
prime_element = [None for i in range(N + 1)]
for i in range(2, N + 1):
    if prime_element[i] is not None:
        continue
    for j in range(i, N + 1, i):
        prime_element[j] = i

divisor_list = {}
for i in range(N):
    for d in divisors(A[i], prime_element):
        divisor_list[A[i]] = divisor_list.get(A[i], []) + [d]
for _ in range(Q):
    L, R, K = map(int, input().split())
    print(lower_bound(divisor_list[K], R) - lower_bound(divisor_list[K], L))