def main():
    n, m = map(int, input().split())
    A = list(map(int, input().split()))
    mod = 998244353

    IsPrime = [True for _ in range(m + 1)]
    IsPrime[0] = IsPrime[1] = False
    Primes = set()
    for i in range(2, m + 1):
        if IsPrime[i]:
            Primes.add(i)
            for j in range(i * i, m + 1, i):
                IsPrime[j] = False
    C = [0 for _ in range(m + 1)]
    for i in range(n):
        C[A[i]] += 1

    ANS = [0 for _ in range(m + 1)]
    for i in range(2, m + 1):
        cnt = 0
        CC = []
        for j in range(i + i, m + 1, i):
            cnt += C[j]
            if j // i in Primes and C[j] > 0:
                CC.append(C[j])
        res = (pow(2, C[i], mod) - 1) * pow(2, cnt, mod) % mod
        k = len(CC)
        for p1 in range(k):
            for p2 in range(p1 + 1, k):
                res += (pow(2, CC[p1], mod) - 1) * (pow(2, CC[p2], mod) - 1) % mod
                res %= mod
        ANS[i] = res
    res = 0
    for i in range(2, m + 1):
        res += ANS[i]
        res %= mod
    ANS[1] = (pow(2, n, mod) - res - 1) % mod
    print(*ANS[1:], sep='\n')

if __name__ == '__main__':
    main()