#include <cstdio>
#include <iostream>

using namespace std;

const int N = 233233;
const int K = 332;
const long long Mod = 998244353;

int n;
int k;
long long nums[N][K];
long long sums[N][K];
long long magic[K][K];
long long res[K];

int main () {
	
	freopen ("MyGo.in", "r", stdin);
	freopen ("MyGo.out", "w", stdout);
	
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
	    cin >> nums[i][1];
	    nums[i][0] = 1;
	    sums[i][0] = (sums[i - 1][0] + nums[i][0]) % Mod;
	    sums[i][1] = (sums[i - 1][1] + nums[i][1]) % Mod;
    }
    
    for (int j = 2; j <= k; j++) {
        for (int i = 1; i <= n; i++) {
            nums[i][j] = nums[i][j - 1] * nums[i][1] % Mod;
            sums[i][j] = (sums[i - 1][j] + nums[i][j]) % Mod;
        }
    }
    
    magic[0][0] = 1;
    for (int i = 1; i <= k; i++) {
        magic[i][0] = 1;
        for (int j = 1; j <= i; j++) {
            magic[i][j] = (magic[i - 1][j - 1] + magic[i - 1][j]) % Mod;
        }
    }
    
    for (int now = 1; now <= k; now++) {
        for (int i = 1; i <= n; i++) {
            for (int a = 0; a <= now; a++) {
                int b = now - a;
                res[now] = (res[now] + nums[i][a] * sums[i - 1][b] % Mod * magic[now][a] % Mod) % Mod;
            }
        }
    }
    
    for (int i = 1; i <= k; i++) {
        cout << res[i] << endl;
    }
	
	return 0; 
}