#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define rrep(i, r, l) for (int i = (int)(r); i > (int)(l); i--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

constexpr long long mod = 998244353;

namespace nono {

long long pow_mod(long long x, long long y, long long p) {
    long long result = 1;
    while (y > 0) {
        if ((y & 1) == 1) {
            result *= x;
            result %= p;
        }
        y >>= 1;
        x *= x;
        x %= p;
    }
    return result;
}

} // namespace nono

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> count(m + 1);
    vector<long long> ans(m + 1, 0);
    rep(i, 0, n) {
        int v;
        cin >> v;
        count[v]++;
    }

    rrep(i, m, 0) {
        int x = 0;
        for (int j = i; j <= m; j += i) {
            x += count[j];
            ans[i] += mod - ans[j];
        }
        ans[i] += nono::pow_mod(2, x, mod) - 1;
        ans[i] %= mod;
    }

    rep(i, 1, m + 1) {
        cout << ans[i] << '\n';
    }
}

int main() {
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}