from math import isqrt
MOD = 998244353

def divsor(x):
  arr = []
  for i in range(1,isqrt(x)+1):
    if x % i == 0:
      arr.append(i)
      if i*i != x:
        arr.append(x//i)
  return arr
    
N,M = map(int,input().split())
A = list(map(int,input().split()))

cnt = [0]*(M+1)
for a in A:
  for d in divsor(a):
    if d <= M:
      cnt[d] += 1

dp = [pow(2,cnt[i],MOD)-1 for i in range(M+1)]

for i in range(M,0,-1):
  for k in range(2*i,M+1,i):
    dp[i] -= dp[k]

for a in dp[1:]:
  print(a%MOD)