#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

const ll modc = 998244353;

long long mod_exp(long long b, long long e, long long m){
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0){
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b*b) % m;
    }

    return ans;
}

int main(){

    ll N, M, A;
    cin >> N >> M;
    vector<ll> c(M+1), cnt(M+1), dp(M+1);
    for (int i=0; i<N; i++){
        cin >> A;
        c[A]++;
    }

    for (int i=1; i<=M; i++){
        for (int j=i; j<=M; j+=i) cnt[i] += c[j];
    }

    for (int i=M; i>=1; i--){
        dp[i] = mod_exp(2, cnt[i], modc) - 1;
        for (int j=2*i; j<=M; j+=i){
            dp[i] += (modc - dp[j]);
            dp[i] %= modc;
        }
    }

    for (int i=1; i<=M; i++) cout << dp[i] << endl;

    return 0;
}