def divisor_enumation(n):
    i=1
    result=set()
    while(i*i<n):
        if n%i==0:
            result.add(i)
            result.add(n//i)
        i+=1
    if i*i==n:
        result.add(i)
    return result

mod=998244353

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

pow_2=[1]
for _ in range(n+1):
    pow_2.append(pow_2[-1]*2%mod)

cnt=[0 for _ in range(m+1)]

for i in range(n):
    a=A[i]
    n=1

    while(n*n<a):
        if a%n==0:
            cnt[n]+=1
            cnt[a//n]+=1
        n+=1
    if n*n==a:
        cnt[n]+=1

dem=[0 for _ in range(m+1)]
ans=[]

for i in range(m,0,-1):
    
    ans.append((pow_2[cnt[i]]-1-dem[i])%mod)

    if cnt[i]==0:
        continue
    
    X=divisor_enumation(i)
    for u in X:
        if u==i:
            continue
        dem[u]+=pow_2[cnt[i]]-1-dem[i]
        dem[u]%=mod

for x in ans[::-1]:
    print(x)