import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
import math
import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
from collections import defaultdict
from collections import deque
import copy #DeepCopy: hoge = [_[:] for _ in hogehoge]
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
MOD = 998244353
dx = [1,0,-1,0]
dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

def main():
    N,M = map(int,input().split()); MAX = 3*pow(10,5)
    pow2 = [1]
    for i in range(MAX):
        pow2.append(pow2[-1]*2%MOD)
    A = list(map(int,input().split()))
    Adic = defaultdict(int)
    for a in A:
        Adic[a] += 1
    dic = defaultdict(int)
    for a,n in Adic.items():
        X = make_divisors(a)
        for x in X:
            dic[x] += n
    # print(dic)
    ans = [0]*(M+1)
    for i in reversed(range(1,M+1)):
        temp = pow2[dic[i]] - 1
        # print(i,temp)
        if temp == 0:
            ans[i] = temp
        else:
            for fac in range(2,MAX):
                if i*fac > M: break
                # print("XX",i*fac,ans[i*fac])
                temp -= ans[i*fac]
                temp %= MOD
            ans[i] = temp
    for i in range(1,M+1):
        print(ans[i]%MOD)
                


if __name__ == '__main__':
    main()