/**
	author:  shobonvip
	created: 2024.11.16 19:57:51
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

//defmodfact
const int COMinitMAX = 998244;
mint fact[COMinitMAX+1], factinv[COMinitMAX+1];

void modfact(){
	fact[0] = 1;
	for (int i=1; i<=COMinitMAX; i++){
		fact[i] = fact[i-1] * i;
	}
	factinv[COMinitMAX] = fact[COMinitMAX].inv();
	for (int i=COMinitMAX-1; i>=0; i--){
		factinv[i] = factinv[i+1] * (i+1);
	}
}

mint binom(int a, int b){
	if (a<b || b<0) return mint(0);
	return fact[a]*factinv[b]*factinv[a-b];
}
//--------

mint op(mint a,mint b) {
	return a * b;
}
mint e(){
	return 1;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	modfact();
	ll n, k; cin >> n >> k;
	vector<ll> a(n);
	rep(i,0,n) cin >> a[i];

	vector<mint> f(n);
	rep(i,0,n) {
		if (i % 2 == 0) {
			f[i] = a[i];
		}else{
			f[i] = -a[i];
		}
	}

	segtree<mint,op,e> kukan(n*2);
	rep(i,0,n) {
		kukan.set(i,  (k+1)/2 + i);
	}
	
	vector<mint> g(n);
	rep(i,0,n) {
		if (i % 2 == 0) {
			g[i] = kukan.prod(0, i/2) * factinv[i/2];
		}else if(k % 2 == 1){
			g[i] = kukan.prod(0, i/2) * factinv[i/2];
		}
		//cout << g[i].val() << ' ';
	}

	vector<mint> h = convolution(f, g);
	rep(i,0,n) {
		cout << h[i].val() << ' ';
	}

	cout << '\n';
}