n,q=map(int,input().split())
dp=[0]*(n+1)
dp[1]=1
for i in range(1,n):
    for k in range(2,10**9):
        if i*k>n:break
        dp[i*k]+=dp[i]
for iii in range(q):
    x=int(input())
    ans=0
    for y in range(x,n+1,x):
        ans+=dp[x]*dp[y//x]
    print(ans)