#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, ll> P;
using mint=modint998244353;
int n, q;
ll x[1500010], xs[1500010];
int main()
{
    int n, q;
    cin>>n>>q;
    x[1]=1;
    for(int i=1; i<=n; i++){
        for(int j=2; i*j<=n; j++){
            x[i*j]+=x[i];
        }
    }
    for(int i=1; i<=n; i++){
        xs[i]=xs[i-1]+x[i];
    }
    while(q--){
        int v;cin>>v;
        cout<<x[v]*xs[n/v]<<endl;
    }
    return 0;
}