def b(x):
    t=[]
    while x:t+=[x%2];x//=2
    return t
D=[[]for i in range(100001)]
for i in range(1,317):
    for j in range(i*i,100001,i):D[j]+=[i]
k,n=map(int,input().split());l=[*map(int,input().split())];M=998244353;B=b(n);L=len(B);div=pow(n,-1,M)
X=[[0,1]+[0]*(k-1) for i in range(len(B))]
Y=[[0,1]+[0]*(k-1) for i in range(sum(B)+1)]
for i in range(2,k+1): #구할 func.값
    c=0
    for j in range(L-1): 
        for p in D[i]:X[j+1][i]=(X[j+1][i]+2*X[j][p]*X[j][i//p]-pow(X[j][p],2,M)*(p**2==i))
    for j in range(L):
        if B[j]:
            for p in D[i]:Y[c+1][i]=(Y[c+1][i]+Y[c][p]*X[j][i//p]+Y[c][i//p]*X[j][p]-Y[c][p]*X[j][p]*(p**2==i))
            c+=1
    a=((l[i-1]-Y[-1][i])*div)%M
    t,d=0,0
    for j in range(L):
        w=pow(2,j,M);X[j][i]=(X[j][i]+(a*w))%M
        if B[j]:t=(t+w)%M;d+=1;Y[d][i]=(Y[d][i]+a*t)%M
print(*X[0][1::])