#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf INT_MAX
#define fr(i,l,r) for (i=(l); i<=(r); i++)
#define rfr(i,l,r) for (i=(l); i>=(r); i--)
template<typename T>inline void read(T &n){
    T w=1; n=0; char ch=getchar();
    while (!isdigit(ch) && ch!=EOF){ if (ch=='-') w=-1; ch=getchar(); }
    while (isdigit(ch) && ch!=EOF){ n=(n<<3)+(n<<1)+(ch&15); ch=getchar(); }
    n*=w;
}
template<typename T>inline void write(T x){
    if (x==0){ putchar('0'); return ; }
    T tmp;
    if (x>0) tmp=x;
    else tmp=-x;
    if (x<0) putchar('-');
    char F[105];
    long long cnt=0;
    while (tmp){
        F[++cnt]=tmp%10+48;
        tmp/=10;
    }
    while (cnt) putchar(F[cnt--]);
}
#define Min(x,y) x = min(x,y)
#define Max(x,y) x = max(x,y)
//基础配置=================================================================================
//多项式模板begin--------------------------------------------------------------------------
//多项式里面，长度为n表示有效的数位是0~n-1
const ll Len = 2100005;
const ll mod = 998244353 , G = 3 , iG = (mod+1)/G;
struct poly{
    ll n;//长度，deg(A) = n-1;
    vector<ll> f;
    void size(ll _n){
        n = _n;
        f.resize(n);
    }
};
ll w[Len],to[Len];
inline void add(ll &x,ll y){
    x+=y;
    if (x>=mod) x-=mod;
}
inline ll addd(ll x,ll y){
    x+=y;
    if (x>=mod) x-=mod;
    return x;
}
ll pw(ll x,ll y){
    ll ans = 1;
    while (y){
        if (y&1) ans = ans * x%mod;
        x = x * x%mod;
        y >>= 1;
    }
    return ans;
}
ll inv(ll x){ return pw(x,mod-2); }
poly operator + (poly a,poly b){
    ll n = max(a.n,b.n);
    a.size(n); b.size(n);
    for (ll i=0; i<n; i++) add(a.f[i],b.f[i]);
    return a;
}
poly operator - (poly a,poly b){
    ll n = max(a.n,b.n);
    a.size(n); b.size(n);
    for (ll i=0; i<n; i++) add(a.f[i],mod-b.f[i]);
    return a;
}
poly pol_mul1(poly a,ll b){//乘常数
    for (ll i=0; i<a.n; i++) a.f[i] = a.f[i] * b%mod;
    return a;
}
poly poly_mul2(poly a,poly b){
    ll n = min(a.n,b.n);
    a.size(n);
    for (ll i=0; i<n; i++) a.f[i] = a.f[i] * b.f[i] %mod;
    return a;
}
ll poly_len(ll n){
    ll len;
    for (len=1; len<n; len<<=1);
    return len;
}
void NTT(ll n,poly &a,ll v){
    ll len,i,j;
    fr(i,1,n-1){
        to[i] = to[i>>1]>>1;
        if (i&1) to[i] |= n>>1;
    }
    fr(i,0,n-1)
        if (i<to[i]) swap(a.f[i],a.f[to[i]]);
    for (len=1; len<n; len<<=1){
        ll x,y;
        if (v==1) x = G; else x = iG;
        x = pw(x,(mod-1)/(len*2));
        w[0] = 1;
        fr(i,1,len) w[i] = w[i-1] * x %mod;
        for (i=0; i<n; i+=2*len){
            fr(j,0,len-1){
                x = a.f[i|j]; y = w[j] * a.f[i|j|len] %mod;
                a.f[i|j] = x+y; if (a.f[i|j]>=mod) a.f[i|j] -= mod;
                a.f[i|j|len] = x-y; if (a.f[i|j|len]<0) a.f[i|j|len] += mod;
            }
        }
    }
    if (v==-1){
        ll x = pw(n,mod-2);
        fr(i,0,n-1) a.f[i] = a.f[i] * x %mod;
    }
}
poly operator * (poly a,poly b){//卷积
    ll len = poly_len(a.n+b.n-1);
    a.f.resize(len);
    b.f.resize(len);
    NTT(len,a,1); NTT(len,b,1);
    for (ll i=0; i<len; i++) a.f[i] = a.f[i]*b.f[i]%mod;
    NTT(len,a,-1);
    a.size(a.n+b.n-1);
    return a;
}
poly poly_inv(ll n,poly a){//f * g = 1 ( mod x^n )
    a.size(n);
    poly ans; ans.size(n);
    if (n==1){ ans.f[0] = pw(a.f[0],mod-2); return ans; }
    poly b = a; b.size((n+1)/2);
    b = poly_inv((n+1)/2,b);
    for (ll i=0; i<b.n; i++) ans.f[i] = addd(b.f[i],b.f[i]);
    ll len = poly_len(2*n);
    a.f.resize(len); b.f.resize(len);
    NTT(len,a,1); NTT(len,b,1);
    for (ll i=0; i<len; i++) ( a.f[i] = a.f[i] * b.f[i] %mod * b.f[i] ) %=mod;
    NTT(len,a,-1);
    for (ll i=0; i<n; i++) add( ans.f[i] , mod-a.f[i] );
    return ans;
}
poly poly_reverse(poly a){
    for (ll i=0; i<a.n-i-1; i++) swap(a.f[i],a.f[a.n-i-1]);
    return a;
}
poly operator / (poly a,poly b){//a/b
    poly ans;
    ans = poly_reverse(a) * poly_inv(a.n-b.n+1,poly_reverse(b));
    ans.size(a.n-b.n+1);
    ans = poly_reverse(ans);
    return ans;
}
poly operator % (poly a,poly b){
    poly ans;
    ans = a - a/b * b;
    ans.size(b.n-1);
    return ans;
}
poly poly_dao(poly a){//导数
    for (ll i=0; i<=a.n-2; i++) a.f[i] = a.f[i+1] * (i+1) %mod;
    a.size(a.n-1);
    return a;
}
poly poly_ji(poly a){//积分
    a.size(a.n+1);
    for (ll i=a.n-1; i>0; i--)
        a.f[i] = a.f[i-1] * inv(i) %mod;
    a.f[0] = 0;
    return a;
}
poly poly_ln(ll n,poly a){//ln(a) (mod x^n)
    poly ans = poly_ji( poly_dao(a) * poly_inv(n,a) );
    ans.size(n);
    return ans;
}
poly poly_exp(ll n,poly a){//exp(a) (mod x^n)
    a.size(n);
    poly ans; ans.size(n);
    if (n==1){ ans.f[0] = 1; return ans; }
    poly b = a; b.size((n+1)/2);
    b = poly_exp(b.n,b);
    a.f[0]++;
    ans = b * ( a - poly_ln(n,b) );
    return ans;
}
poly poly_sqrt(ll n,poly a){//sqrt(a) (mod x^n)
    a.size(n);
    poly ans; ans.size(n);
    if (n==1){ ans.f[0] = 1; return ans; }
    poly b = a; b.size((n+1)/2);
    b = poly_sqrt((n+1)/2,b);
    ans = b*b + a;
    b.size(n);
    for (ll i=0; i<b.n; i++) add( b.f[i] , b.f[i] );
    ans = ans * poly_inv(n,b);
    ans.size(n);//这句一定要写上!!!
    return ans;
}
//多项式模板end----------------------------------------------------------------------------
ll n,m;
poly a,b;
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    ll i,j;
    read(n); read(m);
    a.size(n+1), b.size(m+1);
    fr(i,0,n) read(a.f[i]);
    fr(i,0,m) read(b.f[i]);
    a = a*b;
    fr(i,0,n+m) write(a.f[i]), putchar('\n');
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=512000000 -std=c++11 -O2