    #include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    using P=pair<ll,ll>;
    const int INF=1001001001;
    const int mod=998244353;
    
    struct mint {
      ll x; 
      mint(ll x=0):x((x%mod+mod)%mod){}
      mint operator-() const { return mint(-x);}
      mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
      }
      mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
      }
      mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
      mint operator+(const mint a) const { return mint(*this) += a;}
      mint operator-(const mint a) const { return mint(*this) -= a;}
      mint operator*(const mint a) const { return mint(*this) *= a;}
      mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
      }
       
      mint inv() const { return pow(mod-2);}
      mint& operator/=(const mint a) { return *this *= a.inv();}
      mint operator/(const mint a) const { return mint(*this) /= a;}
     };
      istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
      ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
      struct combination {
      vector<mint> fact, ifact;
      combination(int n):fact(n+1),ifact(n+1) {
        assert(n < mod);
        fact[0] = 1;
        for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
        ifact[n] = fact[n].inv();
        for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
      }
      mint operator()(int n, int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[k]*ifact[n-k];
      }
     } c(2000005);

    int main() {
      int N,K;
      cin>>N>>K;
      vector<ll>A(N);
      rep(i,N){cin>>A[i];}
      vector<mint>sum(K+1);
      rep(i,N){
        mint now=1;
        rep(j,K+1){
          sum[j]+=now;
          now*=A[i];
        }
      }
      for(int x=1;x<=K;x++){
        mint ans=0;
        for(int i=0;i<=x;i++){
          ans+=c(x,i)*sum[i]*sum[x-i];
        }
        ans-=mint(2).pow(x)*sum[x];
        cout<<ans/2<<endl;
      }
      return 0;
    }
#include <bits/stdc++.h>

typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;
typedef double db;
typedef long double db64;

const int N = 2e5, K = 300, MOD = 998244353, I2 = (MOD + 1) / 2;

int n, k, a[N + 5], c[K + 5][K + 5];
int64 s[K + 5];

int main() {
	scanf("%d%d", &n, &k);
	for (int i = 0; i <= k; i++) {
		c[i][0] = 1;
		for (int j = 1; j <= i; j++) {
			c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % MOD;
		}
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		for (int x = 1, j = 0; j <= k; j++, x = (int64)x * a[i] % MOD) {
			s[j] += x;
		}
	}
	for (int i = 0; i <= k; i++) {
		s[i] %= MOD;
	}
	int pw = 2;
	for (int i = 1; i <= k; i++) {
		int64 ans = 0;
		for (int j = 0; j <= i; j++) {
			ans += (int64)s[j] * s[i - j] % MOD * c[i][j] % MOD;
		}
		ans -= (int64)pw * s[i] % MOD;
		pw = (pw + pw) % MOD;
		ans %= MOD;
		printf("%lld\n", (ans * I2 % MOD + MOD) % MOD);
	}
	return 0;
}