#include <bits/stdc++.h>

#define int64 long long int

using namespace std;

inline int Read() {int res; return scanf("%d", &res), res; }
inline int64 Read64() {int64 res; return scanf("%lld", &res), res; }

const int N = 250000 + 5, Mod = 998244353; 
const int G = 3, MAXN_NTT = 1 << 20 | 5, K = 20;

int ksm(int x, int y) {
	(y < 0) && (y += Mod - 1);
	int tmp = 1;
	for(; y; y >>= 1) {
		(y & 1) && (tmp = (int64)tmp * x % Mod);
		x = (int64)x * x % Mod;
	}
	return tmp;
}

int w[MAXN_NTT];

inline void Init() {
    w[1 << K] = ksm(G, (Mod - 1) >> (K + 2));
    for (int i = K; i > 0; i -- ) w[1 << (i - 1)] = 1ll * w[1 << i] * w[1 << i] % Mod;
    w[0] = 1;
    for (int i = 1; i < 1 << K; i ++ ) w[i] = 1ll * w[i & -i] * w[i & (i - 1)] % Mod;
}

inline void DFT(int *a, int n) {
    for (int m = n >> 1; m > 0; m >>= 1) { 
        for (int j = 0, l = 0; j < n; j += m << 1, l ++ ) { 
            for (int i = j; i < j + m; i ++ ) {
                int p = a[i], q = 1ll * a[i + m] * w[l] % Mod;
                (a[i] = p + q) >= Mod && (a[i] -= Mod), (a[i + m] = p - q) < 0 && (a[i + m] += Mod);
            }
        }
	} 
}

inline void IDFT(int *a, int n) {
    for (int m = 1; m < n; m <<= 1) { 
        for (int j = 0, l = 0; j < n; j += m << 1, l ++ ) { 
            for (int i = j; i < j + m; i ++ ) {
                int p = a[i], q = a[i + m];
                (a[i] = p + q) >= Mod && (a[i] -= Mod), a[i + m] = (int64)(p - q + Mod) * w[l] % Mod;
            }
        }
	}
	 
    for (int i = 1; i < n / 2; i ++ ) swap(a[i], a[n - i]);
    int t = Mod - (Mod - 1) / n;
    for (int i = 0; i < n; i ++ ) a[i] = (int64)a[i] * t % Mod;
}

inline void NTT(int *a, int n, int type) {if (type == 1) DFT(a, n); else IDFT(a, n);}

int a_mul[MAXN_NTT], b_mul[MAXN_NTT], c_mul[MAXN_NTT];

int Mul(int *a, int n, int *b, int m, int *c) {
	int S;
	for(S = 1; S <= n + m; S <<= 1);
	
	for(int i = 0; i <= S; ++ i) a_mul[i] = b_mul[i] = 0;
	for(int i = 0; i <= n; ++ i) a_mul[i] = a[i];
	for(int i = 0; i <= m; ++ i) b_mul[i] = b[i];
	
	NTT(a_mul, S, 1), NTT(b_mul, S, 1);
	for(int i = 0; i <= S; ++ i) c_mul[i] = (int64)a_mul[i] * b_mul[i] % Mod;
	NTT(c_mul, S, -1);
	for(int i = 0; i <= n + m; ++ i) c[i] = c_mul[i];
	return n + m;
}

int t_inv[MAXN_NTT], b_inv[MAXN_NTT];

void Inv(int *a, int *b, int n) { // mod x^n
	b_inv[0] = ksm(a[0], Mod - 2);
	
	int S = 1;
	for(S = 1; S <= n; S <<= 1);
	
	for(int T = 2; T <= S; T <<= 1) {
		for(int i = 0; i < (T << 1); ++ i) t_inv[i] = 0;
		for(int i = 0; i < T; ++ i) t_inv[i] = a[i];
		NTT(t_inv, T << 1, 1), NTT(b_inv, T << 1, 1);
		for(int i = 0; i < (T << 1); ++ i) b_inv[i] = (int64)(2ll - (int64)t_inv[i] * b_inv[i] % Mod + Mod) * b_inv[i] % Mod;
		NTT(b_inv, T << 1, -1);
		for(int i = T; i < (T << 1); ++ i) b_inv[i] = 0; 
	}
	
	for(int i = 0; i < n; ++ i) b[i] = b_inv[i]; 
}

int t1_mult[MAXN_NTT], t2_mult[MAXN_NTT];

void Mult(int l, int r, int *var, int *c, int *g, int &n, int *h, int &m) {
	if(l == r) {
		h[0] = 1, h[1] = (Mod - var[l]), m = 1;
		g[0] = c[l], n = 0;
		return ;
	}
	
	int mid = (l + r) >> 1;
	int ln, lm, rn, rm;
	Mult(l, mid, var, c, g, ln, h, lm), Mult(mid + 1, r, var, c, g + mid - l + 1, rn, h + mid - l + 2, rm);
	Mul(g, ln, h + mid - l + 2, rm, t1_mult), Mul(h, lm, g + mid - l + 1, rn, t2_mult);
	Mul(h, lm, h + mid - l + 2, rm, h);
	n = r - l, m = r - l + 1;
	
	for(int i = 0; i <= n; ++ i) (g[i] = t1_mult[i] + t2_mult[i]) >= Mod && (g[i] -= Mod);
}

int t1_muls[MAXN_NTT], t2_muls[MAXN_NTT];

void Muls(int l, int r, int *sum, int *pro, int *b) {
	if(l == r) {
		printf("%lld ", (int64)((int64)sum[0] * b[l] + sum[1]) % Mod);
		pro[0] = b[l], pro[1] = 1;
		return ;
	}
	
	int mid = (l + r) >> 1;
	Muls(l, mid, sum, pro, b);
	
	for(int i = 0; i <= mid - l + 1; ++ i) t1_muls[i] = pro[i];
	reverse(t1_muls, t1_muls + mid - l + 2);
	
	int t3_muls[2 * (r - l + 1) + 5]; 
	int gh = Mul(t1_muls, mid - l + 1, sum, r - l + 1, t3_muls);
	for(int i = mid - l + 1; i <= gh; ++ i) t3_muls[i - (mid - l + 1)] = t3_muls[i];
	for(int i = r - l + 2; i <= gh; ++ i) t3_muls[i] = 0;
	
	Muls(mid + 1, r, t3_muls, pro + mid - l + 2, b); 
	
	Mul(pro, mid - l + 1, pro + mid - l + 2, r - mid, pro);
}

int n, a[MAXN_NTT], b[MAXN_NTT], c[MAXN_NTT];
int g[MAXN_NTT], h[MAXN_NTT];
int tt[MAXN_NTT];

int main() {
	Init(); 
	n = Read();
	
	for(int i = 1; i <= n; ++ i) a[i] = Read();
	for(int i = 1; i <= n; ++ i) b[i] = Read();
	for(int i = 1; i <= n; ++ i) c[i] = Read();
	
	int f1, f2;
	Mult(1, n, a, c, g, f1, h, f2), Inv(h, h, n + 1), f1 = Mul(g, f1, h, n, g); 
	
	tt[0] = 1;
	Muls(1, n, g, tt, b);
	
	return 0;
}