#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
constexpr ll MOD = 998244353;

ll modpow(ll a, ll x){
    ll res = 1;
    for(; x > 0; x >>= 1){
        if(x & 1){
            res *= a;
            res %= MOD;
        }
        a *= a;
        a %= MOD;
    }
    return res;
}

int main(){
    int n, m; cin >> n >> m;
    vector<int> a(n);
    for(auto &it: a) cin >> it;

    const int lim = 200010;
    vector<int> cnt(lim, 0);
    for(auto &it: a) cnt[it]++;
    vector<ll> f(lim, 0);
    for(int i = lim-10; i > 0; i--){
        int tot = 0;
        for(int j = i; j < lim; j += i) tot += cnt[j];
        if(tot == 0) continue;
        f[i] = (modpow(2, tot)-1+MOD)%MOD;
        for(int j = i+i; j < lim; j += i){
            f[i] -= f[j];
            f[i] += MOD;
            f[i] %= MOD;
        }
    }
    for(int i = 1; i <= m; i++) cout << f[i] << '\n';
    return 0;
}