#include <bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

const int mod = 998244353;
namespace Poly {
	const int N = 1e6 + 5;
	int rev[N], pw[N];
	int len, lg;
	int ksm(int a, int b) {
		int ans = 1;
		for (; b; b >>= 1, a = 1ll * a * a % mod) {
			if (b & 1) ans = 1ll * ans * a % mod;
		}
		return ans;
	}
	void init() {
		for (int i = 0; i < len; i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (lg - 1));
		for (int mid = 1; mid < len; mid *= 2) {
			pw[mid] = 1;
			pw[mid + 1] = ksm(3, (mod - 1) / (mid * 2));
			for (int j = 2; j < mid; j++) {
				pw[mid + j] = 1ll * pw[mid + j - 1] * pw[mid + 1] % mod;
			}
		}
	}
	void NTT(vector <int> &f, int op) {
		for (int i = 0; i < len; i++) {
			if (i < rev[i]) swap(f[i], f[rev[i]]);
		}
		for (int mid = 1; mid < len; mid *= 2) {
			for (int i = 0; i < len; i += mid * 2) {
				for (int j = 0; j < mid; j++) {
					int x = f[i + j], y = 1ll * pw[mid + j] * f[i + j + mid] % mod;
					f[i + j] = x + y;
					if (f[i + j] >= mod) f[i + j] -= mod;
					f[i + j + mid] = x - y;
					if (f[i + j + mid] < 0) f[i + j + mid] += mod;
				}
			}
		}
		if (op == -1) {
			int inv = ksm(len, mod - 2);
			for (int i = 0; i < len; i++) f[i] = 1ll * f[i] * inv % mod;
			reverse(f.begin() + 1, f.begin() + len);
		}
	}
	vector <int> poly_mul(vector <int> f, vector <int> g) {
		int n = f.size(), m = g.size();
		len = 1, lg = 0;
		while (len <= n + m) len *= 2, lg++;
		init();
		while ((int)f.size() < len) f.push_back(0);
		while ((int)g.size() < len) g.push_back(0);
		NTT(f, 1);
		NTT(g, 1);
		for (int i = 0; i < len; i++) f[i] = 1ll * f[i] * g[i] % mod;
		NTT(f, -1);
		while ((int)f.size() > n + m) f.pop_back();
		return f;
	}
}

int n, m;
int dp[200005];
queue < vector <int> > q;

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	dp[0] = 1, dp[1] = 0, dp[2] = 1;
	for (int i = 3; i <= n + m - 1; i++) dp[i] = 1ll * (i - 1) * (dp[i - 2] + dp[i - 1]) % mod;
	for (int i = 1, w; i <= n; i++) {
		cin >> w;
		vector <int> now;
		now.push_back(1);
		now.push_back(w);
		q.push(now);
	}
	while (q.size() > 1) {
		auto f = q.front();
		q.pop();
		auto g = q.front();
		q.pop();
		q.push(Poly :: poly_mul(f, g));
	}
	auto f = q.front();
	vector <int> g;
	for (int i = 0; i <= n + m - 1; i++) g.push_back(dp[i]);
	f = Poly :: poly_mul(f, g);
	for (int i = n; i <= n + m - 1; i++) cout << f[i] << '\n';
	QwQ330AwA;
}