#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

pair<vector<int>, vector<int>> primes_lpf(const int n) {
  vector<int> primes; primes.reserve(n / 10);
  vector<int> lpf(n + 1);
  for (int i = 2; i <= n; i += 2) lpf[i] = 2;
  for (int i = 3; i <= n; i += 6) lpf[i] = 3;
  if (2 <= n) primes.push_back(2);
  if (3 <= n) primes.push_back(3);
  // 5 * x <= n, x <= floor(n / 5)
  const int n5 = n / 5;
  int x = 5;
  char add_next = 2;
  for (; x <= n5; x += add_next, add_next ^= 0x2 ^ 4) {
    int px = lpf[x];
    if (px == 0) {
      lpf[x] = px = x;
      primes.push_back(x);
    }
    for (int i = 2;; ++i) {
      int q = primes[i];
      int y = q * x;
      if (y > n) break;
      lpf[y] = q;
      if (q == px) break;
    }
  }
  for (; x <= n; x += add_next, add_next ^= 0x2 ^ 4) {
    if (lpf[x] == 0) {
      lpf[x] = x;
      primes.push_back(x);
    }
  }
  return {move(primes), move(lpf)};
}

constexpr int PSIZE = 1000010;
auto [primes, lpf] = primes_lpf(PSIZE);


vector<int>& divisors_lv(int x) {
  int ps[10], cs[10];
  int sz = 0;
  while (x != 1) {
    int p = lpf[x], c = 0;
    do {x /= p; c++;} while (x % p == 0);
    ps[sz] = p; cs[sz] = c; sz++;
  }
  static vector<int> res;
  res.clear();
  res.emplace_back(1);
  for (int i = 0; i < sz; i++) {
    int p = ps[i], ptr = 0;
    for (int t = cs[i] * res.size(); t > 0; t--)
      res.emplace_back(res[ptr++] * p);
  }
  return res;
}

vector<signed char> build_mu_table(const int n) {
  assert(n < (int)lpf.size());
  vector<signed char> res(n + 1);
  res[1] = 1;
  for(int p: primes) {
    if (p > n) break;
    res[p] = -1;
  }
  for(int x = 2; x <= n; x++) {
    if (!res[x]) continue;
    int px = lpf[x];
    for(int q: primes) {
      if (q == px) break;
      int y = q * x;
      if (y > n) break;
      res[y] = -res[x];
    }
  }
  return res;
}

auto mu = build_mu_table(1000005);
using mint = modint998244353;

vector<mint> fps_inv(vector<mint> f, int precision=-1) {
  if (precision == -1) precision = f.size();
  assert(precision >= 1 && f.size() >= 1 && f[0] != 0);
  auto f0 = f[0];
  if (f0 != 1) {
    f0 = f0.inv();
    for (auto& x : f) x *= f0;
  }
  int sz_tgt = bit_ceil(0U + precision);
  vector<mint> g(sz_tgt), g_ftt, fg;
  g_ftt.reserve(sz_tgt), fg.reserve(sz_tgt);
  g[0] = 1;
  static_assert(mint::mod() > 1 && (mint::mod() - 1) % 4 == 0);
  const mint i4 = mint::raw(mint::mod() - (mint::mod() - 1) / 4);
  mint iz = -1;
  for (int n = 1; n < sz_tgt; n *= 2) {
    fg.assign(f.begin(), f.begin() + min<int>(2 * n, f.size())), fg.resize(2 * n);
    g_ftt.assign(g.begin(), g.begin() + 2 * n);
    internal::butterfly(fg), internal::butterfly(g_ftt);
    for (int i = 0; i < 2 * n; i++) fg[i] *= g_ftt[i];
    internal::butterfly_inv(fg);
    for (int i = 0; i < n; i++) fg[i] = 0;
    internal::butterfly(fg);
    for (int i = 0; i < 2 * n; i++) fg[i] *= g_ftt[i];
    internal::butterfly_inv(fg);
    iz *= i4;
    for (int i = n; i < 2 * n; i++) g[i] = fg[i] * iz;
  }
  g.resize(precision);
  if (f0 != 1) for (auto& x : g) x *= f0;
  return g;
}


} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  using vm = vector<mint>;
  // vector<mint> a(n);
  queue<pair<vm, vm>> q;
  rep(i, n) {
    int x;
    cin >> x;
    // a[i] = x;
    q.push({{1}, {1, -x}});
  }
  while (q.size() >= 2) {
    auto [p1, q1] = move(q.front()); q.pop();
    auto [p2, q2] = move(q.front()); q.pop();
    auto f1 = convolution(p1, q2);
    auto f2 = convolution(p2, q1);
    if (f1.size() < f2.size()) swap(f1, f2);
    rrep(i, ssize(f2)) f1[i] += f2[i];
    q.emplace(move(f1), convolution(q1, q2));
  }
  auto s = convolution(move(q.front().first), fps_inv(move(q.front().second), m + 1));
  for (int l = 1; l <= m; l++) {
    mint ans;
    for (int p : divisors_lv(l)) if (mu[p]) {
      ans += mu[p] * s[p].pow(l/p);
    }
    cout << ans.val() << " \n"[l == m];
  }
}