#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(n); i++)

int N,Q;
vector<i64> dp1;
vector<i64> dp2;


int main() {
    cin >> N >> Q;
    dp1.assign(N+1, 0);
    dp2.assign(N+1, 0);

    dp1[1] = 1;
    for(i64 i=1; i<=N; i++) for(i64 j=i*2; j<=N; j+=i) dp1[j] += dp1[i];

    dp2 = dp1;
    for(i64 i=1; i<=N; i++) dp2[i] += dp2[i-1];

    rep(i,Q){
        int x; cin >> x;
        i64 ans = dp1[x] * dp2[N/x];
        cout << ans << endl;
    }
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;