#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+10;
const int mod=998244353;
ll n,k,a[N],t[510][510];
int main()
{
    freopen("Mujica.in","r",stdin);
    freopen("Mujica.out","w",stdout);
    
    cin>>n>>k;
    for(int i=1;i<=n;i++) cin>>a[i];
    if(n>500){
        cout<<"I can't give you answer"<<endl;
        return 0;
    }
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) t[i][j]=1;
    for(int i=1;i<=k;i++)
    {
        ll sum=0;
        for(int l=1;l<=n-1;l++)
        {
            for(int r=l+1;r<=n;r++)
            {
                t[l][r]=t[l][r]*(a[l]+a[r])%mod;
                sum+=t[l][r];
                sum%=mod;
                //cout<<t[l][r]<<' '<<l<<' '<<r<<endl;
            }
            //cout<<endl;
        }
        cout<<sum<<endl;
    }
    return 0;
}