SIZE=10**5+1; MOD=998244353 #998244353 #ここを変更する

inv = [0]*SIZE  # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE  # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
    fac[i] = fac[i-1]*i%MOD
finv[-1] = pow(fac[-1],MOD-2,MOD)
for i in range(SIZE-1,0,-1):
    finv[i-1] = finv[i]*i%MOD
    inv[i] = finv[i]*fac[i-1]%MOD

def choose(n,r): # nCk mod MOD の計算
    if 0 <= r <= n:
        return (fac[n]*finv[r]%MOD)*finv[n-r]%MOD
    else:
        return 0


n,L = map(int,input().split())
*a, = map(int,input().split())
ans = [0]*n
j = n-1
for i in range(n):
    # i が左向きで最後にゴール
    while j >= 0 and L - a[j] <= a[i]:
        j -= 1
    if j > i: continue
    C = i-j
    for k in range(j+1,i+1):
        ans[k] += choose(C,i-k)
    #print(ans,j,i)

j = n-1
for i in range(n):
    # i が右向きで最後にゴール
    while j >= 0 and a[j] >= L - a[i]:
        j -= 1
    if j < i: continue
    ans[i] += 1
    C = j-i
    for k in range(i+1,j+1)[::-1]:
        ans[k] += choose(C,j-k)

for i in ans:
    print(i%MOD)