#include<bits/stdc++.h>
#define ll long long
#define N 200001
#define mod 998244353
using namespace std;
ll n,k,a[N],ans;
ll qpow(ll x,ll y){
    ll res=1;
    while(y>0){
        if(y%2==1) res=res*x%mod;
        x=x*x%mod;
        y/=2;
    }
    return res;
}
int main(){
    freopen("MyGo.in","r",stdin);
    freopen("MyGo.out","w",stdout);
    cin>>n>>k;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=k;i++){
        for(int j=1;j<n;j++)
        for(int k=j+1;k<=n;k++) ans=(ans+qpow(a[j]+a[k],i))%mod;
        cout<<ans<<endl;
        ans=0;
    }
    return 0;
}