#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

ll dp[1500010];
ll ans[1500010];

int main() {
  memset(dp, 0, sizeof(dp));
  memset(ans, 0, sizeof(ans));

  int N, Q;
  cin >> N >> Q;

  dp[1] = 1;
  for (int i = 1; i <= N; ++i) {
    if (dp[i] == 0) continue;

    int k = 2 * i;
    while (k <= N) {
      dp[k] += dp[i];
      k += i;
    }
  }

  for (int i = 1; i <= N; ++i) {
    for (int k = 1; k <= N / i; ++k) {
      ans[i] += dp[i] * dp[k];
    }
  }

  for (int t = 0; t < Q; ++t) {
    int x;
    cin >> x;

    cout << ans[x] << endl;
  }

  return 0;
}