#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pir pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
inline int re()
{
    int f=1,num=0;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9') num=num*10+c-'0',c=getchar();
    return num*f;
}
int T;
void clear();
const int N=200010,K=310,MOD=998244353,inv2=499122177;
int a[N];
int sumax[K];
int n,k;
void add(int &a,int b){a=(a+b>=MOD?a+b-MOD:a+b);}
int C[K][K];
int pow2[K];
void work()
{
    freopen("MyGo.in","r",stdin);
    freopen("MyGo.out","w",stdout);
    clear();
    n=re();k=re();
    C[0][0]=1;
    for(int i=1;i<=k;i++)
    {
        C[i][0]=1;
        for(int j=1;j<=i;j++)
        {
            C[i][j]=C[i-1][j];
            add(C[i][j],C[i-1][j-1]);
        }
    }
    pow2[0]=1;
    for(int i=1;i<=k;i++) add(pow2[i],pow2[i-1]),add(pow2[i],pow2[i-1]);
    for(int i=1;i<=n;i++)
    {
        a[i]=re();
        int now=1;
        for(int j=0;j<=k;j++)
        {
            add(sumax[j],now);
            now=now*a[i]%MOD;
        }
    }
    for(int x=1;x<=k;x++)
    {
        int ans=0;
        for(int j=0;j<=x;j++) add(ans,sumax[j]*sumax[x-j]%MOD*C[x][j]%MOD);
        ans=(ans-pow2[x]*sumax[x]%MOD+MOD)*inv2%MOD;
        printf("%lld\n",ans);
    }
    return;
}
signed main()
{
    T=1;
    while(T--) work();
    return 0;
}
void clear()
{
    return;
}