#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}



int main(){
    
    int n, q; cin >> n >> q;
    vll dp1(n+1, 0);
    dp1[1] = 1;
    rep2(i, 1, n+1){
        for(int j = 2*i; j <= n; j+=i)dp1[j] += dp1[i];
    }
    vll dp2(n+1, 1);
    drep2(i, n+1, 1){
        for(int j = 2*i; j <=n; j += i)dp2[i] += dp2[j];
    }

    while(q--){
        int i; cin >> i;
        cout << dp1[i]*dp2[i] << endl;
    }

    return 0;
}