n, m = map(int, input().split())
A = list(map(int, input().split()))
mod = 998244353

IsPrime = [True for _ in range(m + 1)]
IsPrime[0] = IsPrime[1] = False
Primes = []
for i in range(2, m + 1):
    if IsPrime[i]:
        Primes.append(i)
        for j in range(i * i, m + 1, i):
            IsPrime[j] = False
k = len(Primes)

C = [0 for _ in range(m + 1)]
for i in range(n):
    C[A[i]] += 1

ANS = [0 for _ in range(m + 1)]
for i in range(2, m + 1):
    cnt = 0
    CC = [0 for _ in range(m + 1)]
    for j in range(i + i, m + 1, i):
        cnt += C[j]
        CC[j // i] = C[j]
    res = (pow(2, C[i], mod) - 1) * pow(2, cnt, mod) % mod
    for p1 in range(m // i + 1):
        for p2 in range(p1 + 1, m // i + 1):
            res += (pow(2, CC[p1], mod) - 1) * (pow(2, CC[p2], mod) - 1) % mod
    ANS[i] = res
s = sum(ANS) % mod
ANS[1] = (pow(2, n, mod) - s - 1) % mod
print(*ANS[1:], sep='\n')