import bisect

M = 100000
R = 330

def enum_divisors(x):
    res = []
    for i in range(1, R+1):
        if x % i == 0:
            square = i * i
            if x > square:
                res.extend([i, x // i])
            elif x == square:
                res.append(i)
            else:
                break
    return res

n, q = map(int, input().split())
a = list(map(int, input().split()))

cnt = [[] for _ in range(M + 1)]

for i in range(n):
    divisors = enum_divisors(a[i])
    for x in divisors:
        cnt[x].append(i)

for _ in range(q):
    l, r, k = map(int, input().split())
    l -= 1
    r -= 1
    li = bisect.bisect_left(cnt[k], l)
    ri = bisect.bisect_right(cnt[k], r)
    print(ri - li)