def divisors(n):
    ans=[]
    for i in range(1,n+1):
        if n%i==0:
            ans.append(i)
        if i**2>n:
            break
    k=len(ans)
    for i in range(k-1,-1,-1):
        if n//ans[i]>ans[k-1]:
            ans.append(n//ans[i])
    return ans
mod=998244353
N,M=map(int,input().split())
A=list(map(int,input().split()))
ans=[0 for i in range(M+1)]
for i in A:
	for j in divisors(i):
		ans[j]+=1
for i in range(M,0,-1):
	ans[i]=((1<<ans[i])-1)%mod
	for j in range(i*2,M+1,i):
		ans[i]=(ans[i]-ans[j])%mod
for i in range(1,M+1):
	print(ans[i])