# 貰う DP

# Sieve of Eratosthenes
class SOE:
  def __init__(self,m):
    self.sieve=[-1]*(m+1)
    self.prime=[]
    for i in range(2,m+1):
      if self.sieve[i]==-1:
        self.prime.append(i)
        self.sieve[i]=i
        j=2*i
        while j<=m:
          self.sieve[j]=i
          j+=i
  
  def primes(self):
    # get primes
    return self.prime
  
  def fact(self,n):
    # prime factorization
    d={}
    while n!=1:
      k=self.sieve[n]
      if k not in d:
        d[k]=0
      d[k]+=1
      n//=k
    return d
  
  def div(self,n):
    # get divisors
    c=[1]
    while n!=1:
      p=self.sieve[n]
      cnt=1
      n//=p
      while self.sieve[n]==p:
        cnt+=1
        n//=p
      s=c.copy()
      for i in s:
        for j in range(1,cnt+1):
          c.append(i*(p**j))
    return c

n,q=map(int,input().split())
soe=SOE(n)
dp=[0]*(n+1)
dp[1]=1
sm=[0]*(n+1)
for i in range(1,n+1):
  for j in soe.div(i):
    if i!=j:
      dp[i]+=dp[j]
  sm[i]=dp[i]+sm[i-1]
for _ in range(q):
  x=int(input())
  print(dp[x]*sm[n//x])