#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(ll i=a;i<=b;i++)
ll read(){
    ll x=0,f=1;char c=getchar();
    while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
    while(isdigit(c)){x=x*10+c-'0';c=getchar();}
    return x*f;
}
#define d read()
const ll mod=998244353;
ll C[3030][3030];
ll dp[3030],s;
ll n,m;
ll a[3010];
ll res[3030];
int main(){
    C[0][0]=1;
    f(i,1,3000){
        C[i][0]=1;
        f(j,1,i){
            C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
        }
    }n=d,m=d;f(i,1,n)a[i]=d;
    sort(a+1,a+n+1,greater<ll>());
    dp[0]=1;f(i,1,n){
        ll t=0;f(j,m-a[i],m)t=(t+dp[j])%mod;
        // cout<<i<<" "<<t<<endl;
        f(j,0,n)res[j]=(res[j]+C[n-i][j]*t)%mod;
        dp[m]=dp[m]*2%mod;
        f(j,m-a[i],m-1)dp[m]=(dp[m]+dp[j])%mod;
        for(int j=m-1-a[i];j>=0;j--){
            dp[j+a[i]]=(dp[j+a[i]]+dp[j])%mod;
        }
        // f(j,0,m)cout<<dp[j]<<" ";cout<<endl;
    }f(i,0,n)cout<<res[i]<<endl;
    return 0;
}