#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

class Eratosthenes {
    vector<int> plist;

public:
    Eratosthenes(int sz) : plist(sz, -1) {
        for (int i = 2; i < sz; i++) {
            if (plist[i] == -1) {
                for (int j = i; j < sz; j += i) {
                    if (plist[j] == -1) {
                        plist[j] = i;
                    }
                }
            }
        }
    }
    bool is_prime(int n) {
        return plist[n] == n;
    }
    vector<int> factor(int n) {
        vector<int> res;
        while (n > 1) {
            res.push_back(plist[n]);
            n /= plist[n];
        }
        return res;
    }
    vector<int> divisor(int n) {
        vector<pair<int, int>> runlength;
        for (auto e : this->factor(n)) {
            if (runlength.size() == 0 || runlength.back().first != e) {
                runlength.emplace_back(e, 1);
            } else {
                runlength.back().second++;
            }
        }
        vector<int> res;
        auto dfs = [&](auto &f, unsigned int idx, int d) {
            if (idx == runlength.size()) {
                res.push_back(d);
                return;
            }
            for (int i = 0, m = 1; i <= runlength[idx].second; i++, m *= runlength[idx].first) {
                f(f, idx + 1, d * m);
            }
        };
        dfs(dfs, 0, 1);
        // sort(res.begin(), res.end());
        return res;
    }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, q;
    cin, n, q;
    vector<ll> ans1(n + 1, 0), ans2(n + 1, 1);
    ans1[1] = 1;
    Eratosthenes erat(n + 1);
    for (int i = 1; i <= n; i++) {
        for (int j = 2 * i; j <= n; j += i) {
            ans1[j] += ans1[i];
        }
    }
    for (int i = n; i >= 1; i--) {
        for (auto e : erat.divisor(i)) {
            ans2[e] += ans2[i];
        }
    }
    rep(i, 0, q) {
        int x;
        cin, x;
        print(ans1[x] * ans2[x] / 2);
    }
    return 0;
}