#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 998244353;
const int G = 1919810;
int ro[2700000],n,m,a[2700000],b[2700000];
ull po[2700000],invG;
ll qpow(ll a,ll b) {
	ll res = 1;
	while (b) {
		if (b & 1) res = res * a % mod;
		b >>= 1;
		a = a * a % mod;
	}
	return res;
}
void init() {
	for (int i = 0;i < n;i ++ )
		ro[i] = (ro[i>>1] >> 1) | ((i & 1) ? n >> 1 : 0);
}
ull g[2700000];
void NTT(int *f,bool fl) {
	for (int i = 0;i < n;i ++ )
		g[i] = f[ro[i]];
	for (int w = 1;w < n;w <<= 1) {
		ull prt = qpow(fl ? G : invG,(mod-1)/(w*2));
		po[0] = 1;
		for (int i = 1;i <= w;i ++ ) po[i] = po[i-1] * prt % mod;
		for (int k = 0;k < n;k += w*2) {
			for (int l = 0;l < w;l ++ ) {
				int tt = po[l] * g[w|k|l] % mod;
				g[w|k|l] = g[k|l]-tt+mod;
				g[k|l] += tt;
			}
		}
		if (w == 1<<17)
			for (int i = 0;i < n;i ++ ) g[i] %= mod;
	}
	if (!fl) {
		ull inv = qpow(n,mod-2);
		for (int i = 0;i < n;i ++ ) f[i] = g[i] % mod * inv % mod;
	}
	else for (int i = 0;i < n;i ++ ) f[i] = g[i] % mod;
}
int read() {
	int s = 0,f = 1;char ch = getchar();
	while (!isdigit(ch)) f = ch == '-' ? -1 : 1, ch = getchar();
	while (isdigit(ch)) s = s * 10 + ch - '0', ch = getchar();
	return s*f;
}
int main() {
	n = read()+1,m = read()+1;
	invG = qpow(G,mod-2);
	int t = n;
	for (int i = 0;i < n;i ++ ) a[i] = read();
	for (int i = 0;i < m;i ++ ) b[i] = read();
	for (n = 1;n <= t+m;n <<= 1);
	init();
	NTT(a,1),NTT(b,1);
	for (int i = 0;i < n;i ++ ) a[i] = 1ll * a[i] * b[i] % mod;
	NTT(a,0);
	for (int i = 0;i < t+m-1;i ++ ) printf("%d ",a[i]);
	return 0;
}