from collections import defaultdict as dd
import bisect

def div(N):
    res = []
    for i in range(1, N+1):
        if i*i>N:
            break
        if N%i!=0:
            continue
        res.append(i)
        if N//i != i:
            res.append(N//i)
    res.sort()
    return res

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

for i in range(N):
    res = div(A[i])
    #print(res)
    for val in res:
        div_idx[val].append(i)

#print(div_idx)
for _ in range(Q):
    l,r,k = map(int, input().split())
    ll = bisect.bisect_left(div_idx[k],l-1)
    rr = bisect.bisect_right(div_idx[k],r-1)
    print(rr-ll)