#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mymod(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;
//using namespace atcoder;

template<int mod>
struct Modint{
    int x;
    Modint():x(0){}
    Modint(int64_t y):x((y%mod+mod)%mod){}

    Modint &operator+=(const Modint &p){
			if((x+=p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator-=(const Modint &p){
			if((x+=mod-p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator*=(const Modint &p){
			x = (1LL * x * p.x) % mod;
			return *this;
		}

		Modint &operator/=(const Modint &p){
			*this *= p.inverse();
			return *this;
		}

		Modint operator-() const { return Modint(-x); }
		Modint operator+(const Modint &p) const{
			return Modint(*this) += p;
		}
		Modint operator-(const Modint &p) const{
			return Modint(*this) -= p;
		}
		Modint operator*(const Modint &p) const{
			return Modint(*this) *= p;
		}
		Modint operator/(const Modint &p) const{
			return Modint(*this) /= p;
		}

		bool operator==(const Modint &p) const { return x == p.x; }
		bool operator!=(const Modint &p) const{return x != p.x;}

		Modint inverse() const{//非再帰拡張ユークリッド
			int a = x, b = mod, u = 1, v = 0;
			while(b>0){
				int t = a / b;
				swap(a -= t * b, b);
				swap(u -= t * v, v);
			}
			return Modint(u);
		}

		Modint pow(int64_t n) const{//繰り返し二乗法
			Modint ret(1), mul(x);
			while(n>0){
				if(n&1)
					ret *= mul;
				mul *= mul;
				n >>= 1;
			}
			return ret;
		}

		friend ostream &operator<<(ostream &os,const Modint &p){
			return os << p.x;
		}
};

using modint = Modint<mod>;

template<typename T>
struct Combination{
  //Modint用
  //構築O(N),クエリO(1)
	vector<T>fact,rfact;

	Combination(int n):fact(n+1),rfact(n+1){
		fact[0]=1;fact[1]=1;
		rfact[n]=1;
		for(int i=2;i<=n;++i){
			fact[i]=fact[i-1]*i;
		}
		rfact[n]/=fact[n];
		for(int i=n-1;i>=0;--i){
			rfact[i]=rfact[i+1]*(i+1);
		}
	}

	T C(int n,int r) const{
		if(r<0 || n<r)return 0;
		return fact[n]*rfact[n-r]*rfact[r];
	}
};



void solve()
{
	ll n,k;
	cin>>n>>k;
	vector<ll>a(n);
	rep(i,n)cin>>a[i];
	constexpr ll m=998244353;
	Combination<Modint<m>>c(k+1);
	vector<Modint<m>>sum(k+1),sum2(k+1);
	rep(i,n){
		Modint<m>x=1,y=1;
		rep(j,k+1){
			sum[j]+=x;
			sum2[j]+=y;
			x*=a[i];
			y*=a[i]*2;
		}
	}
	REP(i,1,k+1){
		Modint<m>ans=0;
		rep(j,i+1){
			ans+=c.C(i,j)*sum[j]*sum[i-j];
		}
		ans=(ans-sum2[i])/2;
		cout<<ans<<"\n";
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}

/*
ID: gurban1
LANG: C++
TASK: 
*/
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int N = 3e2+5;
const int mod=998244353;
const int maxn=2e5+5;
int n,k;
int a[maxn];
ll C[N][N],ans[N];
ll dp[maxn],pw[maxn][N];

ll bigmod(ll a,ll b) {if(b==0)return 1;ll x=bigmod(a*a%mod,b>>1);return b&1?x*a%mod:x;}

int main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);

	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> k;
	for(int i = 1;i <= n;i++) cin >> a[i],pw[i][0] = 1;

	C[0][0] = 1;
	for(int i = 0;i <= k;i++){
		for(int j = 0;j <= i;j++){
			if(j == 0){C[i][j] = 1;continue;}
			if(i == j){C[i][j] = 1;continue;}
			C[i][j] = C[i-1][j-1] + C[i-1][j]; if(C[i][j] > mod) C[i][j] -= mod;
		}
	}

	ll iki = bigmod(2,mod-2);

	dp[0] = n;

	for(int i = 1;i <= k;i++){
		for(int j = 1;j <= n;j++){
			pw[j][i] = (pw[j][i-1] * a[j])%mod;
			dp[i] = (dp[i] + pw[j][i]); if(dp[i] > mod) dp[i] -= mod;
		}
	}

	for(int i = 0;i <= k;i++){
		for(int j = i;j+i <= k;j++){
			ll nw = (dp[i] * dp[j])%mod;
			nw -= dp[i + j]; if(nw < 0) nw += mod;
			if(i == j){nw = (nw * iki) % mod;}
			nw = (C[i+j][i] * nw) % mod;
			// if(i == 1 and j == 1) cout<<nw<<'\n';
			ans[i + j] += nw; if(ans[i+j] > mod) ans[i+j] -= mod;
		}
	}
	for(int i = 1;i <= k;i++) cout<<ans[i]<<'\n';
}