#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;

const long long modc = 998244353;
set<long long> factor;

void all_factor(long long n){
    factor.clear();
    for (long long i = 1; i*i <= n; i++){
        if (n % i == 0){
            factor.insert(i);
            factor.insert(n / i);
        }
    }
}

long long mod_exp(long long b, long long e){
    const long long m=modc;
    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(){

    int N, M;
    cin >> N >> M;
    vector<long long> A(N), cnt(M+1), ans(M+1);
    for (int i=0; i<N; i++) cin >> A[i];

    for (int i=0; i<N; i++){
        all_factor(A[i]);
        for (auto x : factor) cnt[x]++;
    }

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

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

    return 0;
}