#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<ctime>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<map>
using namespace std;
typedef long long LL;
const int MR=1.5e6+10;
int n,Q,x;
LL dp[MR],s[MR];
int main(){
    scanf("%d%d",&n,&Q);
    dp[1] = 1;
    for(int i=1;i<=n;i++) {
        for(int j=2*i;j<=n;j+=i){
            dp[j] += dp[i];
        }
        s[i] = s[i-1] + dp[i];
    }
    while(Q--){
        scanf("%d",&x);
        printf("%lld\n",dp[x]*s[n/x]);
    }
    return 0;
}