N,Q = map(int,input().split())
dp = [0]*(N+1);
su = [0]*(N+1)
dp[1] = 1;
for i in range(1,N+1):
    su[i] = dp[i]+su[i-1]
    for j in range(2,N+1):
        if i*j > N:
            break
        dp[i*j] += dp[i]

for i in range(Q):
    x = int(input())
    print(dp[x]*su[N//x])