#include <bits/stdc++.h>

#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = (1<<21) + 5;
const int ha = 998244353;

inline int qpow(int a,int n=ha-2){
	int res = 1;
	while(n){
		if(n & 1) res = 1ll*res*a%ha;
		a = 1ll*a*a%ha;
		n >>= 1;
	}
	return res;
}

struct Poly{
    std::vector<int> x;
    inline int deg(){return SZ(x)-1;}
    inline void ext(const int &n){x.resize(n+1);}
    inline int& operator [] (const int &n){return x[n];}
};

int r[MAXN],N;

inline void init(int n){
    int len = 0;N = 1;while(N <= n) N <<= 1,++len;
    FOR(i,0,N-1) r[i] = (r[i>>1]>>1)|((i&1)<<(len-1));
}

inline void NTT(Poly &A,int opt){
    A.ext(N-1);FOR(i,0,N-1) if(i < r[i]) std::swap(A[i],A[r[i]]);
    for(int mid = 1;mid < N;mid <<= 1){
        int W = qpow(3,(ha-1)/(mid<<1));
        for(int i = 0;i < N;i += (mid<<1)){
            for(int j = 0,w = 1;j < mid;++j,w = 1ll*w*W%ha){
                int x = A[i+j],y = 1ll*w*A[i+mid+j]%ha;
                A[i+j] = (x+y)%ha;A[i+mid+j] = (x+ha-y)%ha;
            }
        }
    }
    if(opt == -1){
        std::reverse(A.x.begin()+1,A.x.end());
        int inv = qpow(N);FOR(i,0,N-1) A[i] = 1ll*A[i]*inv%ha;
    }
}

Poly operator * (Poly A,Poly B){
    int len = A.deg()+B.deg();init(len);
    NTT(A,1);NTT(B,1);
    FOR(i,0,N-1) A[i] = 1ll*A[i]*B[i]%ha;
    NTT(A,-1);A.ext(len);
    return A;
}

int main(){
    int n,m;Poly A,B;scanf("%d%d",&n,&m);
    A.ext(n);B.ext(m);
    FOR(i,0,n) scanf("%d",&A[i]);
    FOR(i,0,m) scanf("%d",&B[i]);
    A = A*B;
    FOR(i,0,n+m) printf("%d ",A[i]);puts("");
    return 0;
}