Problem: Our child likes computer science very much, especially he likes binary trees.

Consider the sequence of n distinct positive integers: c1, c2, ..., cn. The child calls a vertex-weighted rooted binary tree good if and only if for every vertex v, the weight of v is in the set {c1, c2, ..., cn}. Also our child thinks that the weight of a vertex-weighted tree is the sum of all vertices' weights.

Given an integer m, can you for all s (1 ≤ s ≤ m) calculate the number of good vertex-weighted rooted binary trees with weight s? Please, check the samples for better understanding what trees are considered different.

We only want to know the answer modulo 998244353 (7 × 17 × 223 + 1, a prime number).

Input

The first line contains two integers n, m (1 ≤ n ≤ 105; 1 ≤ m ≤ 105). The second line contains n space-separated pairwise distinct integers c1, c2, ..., cn. (1 ≤ ci ≤ 105).

Output

Print m lines, each line containing a single integer. The i-th line must contain the number of good vertex-weighted rooted binary trees whose weight exactly equal to i. Print the answers modulo 998244353 (7 × 17 × 223 + 1, a prime number).

Examples

Input

2 3
1 2


Output

1
3
9


Input

3 10
9 4 3


Output

0
0
1
1
0
2
4
2
6
15


Input

5 10
13 10 6 4 15


Output

0
0
0
1
0
1
0
2
0
5

Note

In the first example, there are 9 good vertex-weighted rooted binary trees whose weight exactly equal to 3:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using int64 = long long;
using uchar = unsigned char;
constexpr int mxdg(262144);
constexpr int p(998244353);
constexpr int hfp(p >> 1);
constexpr int proot(3);
template <class _Tp>
inline void swap(_Tp& x, _Tp& y) {
  _Tp z = x;
  x = y;
  y = z;
}
template <class _Tp>
inline int fpow(_Tp v, int n) {
  int pw = 1;
  for (; n; n >>= 1, v = (int64)v * v % p)
    if (n & 1) pw = (int64)pw * v % p;
  return pw;
}
template <class _Tpx, class _Tpy>
inline void inc(_Tpx& x, const _Tpy& y) {
  (p - y <= x) ? (x += y - p) : (x += y);
}
template <class _Tpx, class _Tpy>
inline void dec(_Tpx& x, const _Tpy& y) {
  x -= y;
  (x < 0) && (x += p);
}
template <class _Tpx, class _Tpy>
inline _Tpx pls(const _Tpx& x, const _Tpy& y) {
  return (x < p - y) ? (x + y) : (x - p + y);
}
template <class _Tpx, class _Tpy>
inline _Tpx sub(const _Tpx& x, const _Tpy& y) {
  return (x < y) ? (x - y + p) : (x - y);
}
template <class _Tp>
inline int div2(const _Tp& v) {
  return (v & 1) ? (v + p) >> 1 : (v >> 1);
}
template <class _Tp>
inline _Tp Max(const _Tp& x, const _Tp& y) {
  return x > y ? x : y;
}
namespace IOManager {
constexpr int FILESZ(131072);
char buf[FILESZ];
const char *ibuf = buf, *tbuf = buf;
struct IOManager {
  inline char gc() {
    return (ibuf == tbuf) &&
                   (tbuf = (ibuf = buf) + fread(buf, 1, FILESZ, stdin),
                    ibuf == tbuf)
               ? EOF
               : *ibuf++;
  }
  template <class _Tp>
  inline operator _Tp() {
    _Tp s = 0u;
    char c = gc();
    for (; c < 48; c = gc())
      ;
    for (; c > 47; c = gc()) s = (_Tp)(s * 10u + c - 48u);
    return s;
  }
};
}  // namespace IOManager
IOManager::IOManager io;
int omg_n;
int omg[mxdg + 1], iomg[mxdg + 1];
inline void init_omg(const int& n = mxdg) {
  omg_n = n;
  const int ob = fpow(proot, (p - 1) / n);
  const int iob = fpow(ob, p - 2);
  omg[0] = iomg[0] = 1;
  for (int i = 1, v = 1, iv = 1; i != n; ++i) {
    v = (int64)v * ob % p;
    omg[i] = v;
    iv = (int64)iv * iob % p;
    iomg[i] = iv;
  }
}
template <class _Tp>
void DFT(_Tp* A, const int& deg) {
  for (int i = 0, j = 0; i != deg; ++i) {
    if (i < j) swap(A[i], A[j]);
    for (int k = deg >> 1; (j ^= k) < k; k >>= 1)
      ;
  }
  _Tp* const td = A + deg;
  for (int l = 1, tp = omg_n >> 1; l < deg; l += l, tp >>= 1)
    for (_Tp *i = A, z; i < td; i += l + l)
      for (int j = 0, *w = omg; j != l; ++j, w += tp)
        z = (int64)i[j + l] * *w % p, i[j + l] = sub(i[j], z), inc(i[j], z);
}
template <class _Tp>
void IDFT(_Tp* A, const int& deg) {
  for (int i = 0, j = 0; i != deg; ++i) {
    if (i < j) swap(A[i], A[j]);
    for (int k = deg >> 1; (j ^= k) < k; k >>= 1)
      ;
  }
  _Tp* const td = A + deg;
  for (int l = 1, tp = omg_n >> 1; l < deg; l += l, tp >>= 1)
    for (_Tp *i = A, z; i < td; i += l + l)
      for (int j = 0, *w = iomg; j != l; ++j, w += tp)
        z = (int64)i[j + l] * *w % p, i[j + l] = sub(i[j], z), inc(i[j], z);
  const int invdeg = fpow(deg, p - 2);
  for (int i = 0; i != deg; ++i) A[i] = (int64)A[i] * invdeg % p;
}
int tmp[3][mxdg + 1];
inline void cp(const int* const& srcs, const int* const& srct, int* const& dsts,
               int* const& dstt) {
  std::copy(srcs, srct, dsts);
  if (srct - srcs < dstt - dsts) std::fill(dsts + (srct - srcs), dstt, 0);
}
void polyinv(const int* const& F, int* const& invF, const int& n) {
  if (n == 1) return (void)(invF[0] = fpow(F[0], p - 2));
  polyinv(F, invF, (n + 1) >> 1);
  static int* const& inv_tmp = tmp[0];
  int deg = 1;
  for (; deg <= n + n + 3; deg += deg)
    ;
  cp(F, F + n, inv_tmp, inv_tmp + deg);
  std::fill(invF + ((n + 1) >> 1), invF + deg, 0);
  DFT(inv_tmp, deg);
  DFT(invF, deg);
  for (int i = 0; i != deg; ++i)
    invF[i] = (int64)invF[i] * sub(2ll, (int64)inv_tmp[i] * invF[i] % p) % p;
  IDFT(invF, deg);
  std::fill(invF + n, invF + deg, 0);
}
void polysqrt(const int* const& F, int* const& rt, const int& n) {
  if (n == 1) return (void)(rt[0] = 1);
  static int *const &rt_tmp = tmp[0], *const &inv_tmp = tmp[1];
  const int m = (n + 1) >> 1;
  polysqrt(F, rt, m);
  polyinv(rt, inv_tmp, n);
  int deg = 1;
  for (; deg <= n + n + 3; deg += deg)
    ;
  cp(F, F + n, rt_tmp, rt_tmp + deg);
  DFT(rt_tmp, deg);
  DFT(inv_tmp, deg);
  for (int i = 0; i != deg; ++i) inv_tmp[i] = (int64)inv_tmp[i] * rt_tmp[i] % p;
  IDFT(inv_tmp, deg);
  for (int i = m; i != n; ++i) rt[i] = div2(inv_tmp[i]);
}
int C[mxdg + 1], rt[mxdg + 1];
int main() {
  int n = io;
  const int m((int)io + 1);
  C[0] = 1;
  for (int i; n; --n)
    if ((i = io) < m) C[i] = 998244349;
  int dg = 1;
  for (; dg <= m + m + 3; dg += dg)
    ;
  init_omg(dg);
  polysqrt(C, rt, m);
  inc(rt[0], 1);
  polyinv(rt, C, m);
  for (int i = 1; i < m; ++i)
    printf("%d\n", C[i] <= hfp ? C[i] + C[i] : (C[i] + C[i] - p));
  return 0;
}