#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1010,mod=998244353;
int n,k,a[N];
ll sum=0,s[N][N],p[N][N];
int main () {
    freopen("MyGo.in","r",stdin);
    freopen("MyGo.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin >> n >> k;
    for (int i=1;i<=n;i++) {
        cin >> a[i]; 
    }
    for (int i=1;i<=n;i++) {
        for (int j=i+1;j<=n;j++) {
            p[i][j]=s[i][j]=(a[i]+a[j])%mod;
            sum=(sum+p[i][j])%mod;
        }
    }
    cout << sum <<"\n";
    for (int t=2;t<=k;t++) {
        sum=0;
        for (int i=1;i<=n;i++) {
            for (int j=i+1;j<=n;j++) {
                p[i][j]=s[i][j]*p[i][j]%mod;
                sum=(sum+p[i][j])%mod;
            }
        }
        cout << sum <<"\n";
    }
    return 0;
}