def makediv(n):
	lower_divisors , upper_divisors = [], []
	i = 1
	while i*i <= n:
		if n % i == 0:
			lower_divisors.append(i)
			if i != n // i:
				upper_divisors.append(n//i)
		i += 1
	return lower_divisors + upper_divisors[::-1]


mod = 998244353
n,m = map(int,input().split())
a = list(map(int,input().split()))
c = [0] * (m + 1)

for i in range(n):
	for j in makediv(a[i]):
		c[j] += 1

dp = [0] * (m + 1)

for i in range(m,0,-1):
	dp[i] = pow(2, c[i], mod) - 1
	for j in range(2*i, m+1, i):
		if j % i == 0:
			dp[i] -= dp[j]
			dp[i] %= mod

print(*dp[1:],sep="\n")