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 main():
    N,M = map(int,input().split())
    A = list(map(int,input().split()))

    dic = defaultdict(int)

    for a in A:
        pdic = copy.copy(dic)
        pdic,dic = dic,pdic
        for v,n in pdic.items():
            # print(a,v)
            dic[math.gcd(a,v)] += n %MOD
            dic[math.gcd(a,v)] %= MOD
        dic[a] += 1
        dic[a] %= MOD
        # print(dic)
    
    for i in range(1,M+1):
        print(dic[i])
        


if __name__ == '__main__':
    main()