#pragma GCC optimize("Ofast")
#include <limits.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <cmath>
#include <iomanip>
#include <string>
#include <deque>
#include <assert.h>
#include <random>
#include <ctime>
#include <unordered_map>
#include <complex>
#include <chrono>

#define pnode node*

using namespace std;

typedef long long ll;
typedef long double ld;

const ll mod = 998244353;

ll n, k;

ll pw(ll a, ll p) {
    if (p == 0) {
		return 1;
    }
    ll b = pw(a, p / 2);
    if (p % 2 == 0) {
        return (b * b) % mod;
    } else {
        return (((b * b) % mod) * a) % mod;
    }
}

ll rev(ll a) {
    return pw(a, mod - 2);
}


vector < ll > smpw;
vector < ll > pwsm;
vector < vector < ll > > c;
vector < ll > a;



void solve(){
	cin >> n >> k;
	a.resize(n);
	smpw.resize(k + 1);
    pwsm.resize(k + 1);
    c.resize(k + 1, vector < ll > (k + 1));
    for (ll i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (ll i = 0; i <= k; ++i) {
		ll cursm = 0;
        ll curpw = 0;
        for (ll j = 0; j < n; ++j) {
            cursm += a[j];
        }
        cursm = pw(cursm, i);
        cursm %= mod;
        for (ll j = 0; j < n; ++j) {
            curpw += pw(a[j], i);
        }
        curpw %= mod;
        smpw[i] = cursm;
        pwsm[i] = curpw;
    }
    for (ll i = 0; i <= k; ++i){
        for (ll j = 0; j <= k; ++j) {
            if (i < j) {
                c[i][j] = 0;
                continue;
            }
            if (i == 0 || j == 0) {
                c[i][j] = 1;
                continue;
            }
            c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
        }
    }
//    cerr << k << " " << k - 1 << " " << c[k][k - 1] << "\n\n";
    for (ll p = 1; p <= k; ++p) {
    	ll ans = 0;
        for (ll i = 0; i <= p; ++i) {
            // c[p][i];
            // i, p - i
            ll add = (pwsm[i] * pwsm[p - i]) % mod;
            add = (add - pwsm[p] + mod) % mod;
            add = (add * c[p][i]) % mod;
            ans += add;
            ans %= mod;
        }
        cout << (ans * rev(2)) % mod << "\n";
    }
}

signed main(){
    ll t = 1;
    ios_base::sync_with_stdio(0);
    srand(time(0));
    cin.tie(0);
    cout.tie(0);
    cout << fixed;
    cout << setprecision(20);
    #ifdef DEBUG
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
    #endif
    while(t--){
        solve();
    }
}

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
template <class T, class U>
inline bool chmax(T &a, U b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T, class U>
inline bool chmin(T &a, U b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
constexpr int INF = 1000000000;
constexpr ll llINF = 1000000000000000000;
constexpr int mod = 998244353;
constexpr double eps = 1e-10;
const double pi = acos(-1);
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int Random(int mi, int ma) {
    random_device rnd;
    mt19937 mt(rnd());  // 32bit
    //[mi,ma]
    uniform_int_distribution<int> engine(mi, ma);
    return engine(mt);
}
/*
vector<vector<ll>>C,sC;
void init_comb(int n,int m){
    C.resize(n+1,vector<ll>(m+1,0));
    sC.resize(n+1,vector<ll>(m+1,0));
    C[0][0]=1;
    for(int i=1;i<=n;i++){
        C[i][0]=1;
        for(int j=1;j<=m;j++){
            C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
        }
    }
    rep(i,n+1){
        rep(j,m){
            sC[i][j+1]=(sC[i][j]+C[i][j])%mod;
        }
    }
}*/
bool prime(int a) {
    if (a == 1) return false;
    for (int i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}
vector<int> primes;
void init_prime(int n) {
    primes.push_back(2);
    for (int i = 3; i <= n; i += 2) {
        bool f = true;
        for (int j : primes) {
            if (j * j > i) break;
            if (i % j == 0) {
                f = false;
                break;
            }
        }
        if (f) primes.push_back(i);
    }
}
ll modpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res *= a;
            res %= mod;
        }
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return res;
}
vector<ll> inv, fact, factinv;
void init_fact(int n) {
    inv.resize(n + 1);
    fact.resize(n + 1);
    factinv.resize(n + 1);
    inv[0] = 0;
    inv[1] = 1;
    fact[0] = 1;
    factinv[0] = 1;
    for (ll i = 1; i <= n; i++) {
        if (i >= 2) inv[i] = mod - ((mod / i) * inv[mod % i] % mod);
        fact[i] = (fact[i - 1] * i) % mod;
        factinv[i] = factinv[i - 1] * inv[i] % mod;
    }
}
ll _inv(ll a, ll m = mod) {
    // gcd(a,m) must be 1
    ll b = m, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}
ll comb(int a, int b) {
    if (a < b) return 0;
    if (a < 0) return 0;
    return fact[a] * factinv[a - b] % mod * factinv[b] % mod;
}
ll multicomb(int a, int b) { return comb(a + b - 1, b); }

void solve() {
    int n, a[200010];
    cin >> n;
    ll ma = 0, sum = 0, cur = 0;
    rep(i, n) {
        cin >> a[i];
        sum += a[i];
        chmax(ma, a[i]);
        cur += sum;
        cout << ma * (i + 1) + cur << endl;
    }
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // int t;cin >> t;while (t--)
    solve();
    return 0;
}