def solve():
    N,M=map(int,input().split())
    A=list(map(int,input().split()))

    X=[0]*(M+1)
    for a in A:
        X[a]+=1

    B=[0]*(M+1); Mod=998244353
    for k in range(M,0,-1):
        count=0
        for a in range(k, M+1, k):
            count+=X[a]
        B[k]=pow(2,count,Mod)-1

        for a in range(2*k, M+1, k):
            B[k]-=B[a]

        B[k]%=Mod

    return B[1:]

#==================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write

write("\n".join(map(str,solve())))