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

typedef long double db;
typedef long long ll;
const int maxn=(1<<21)+10;
const db pi=acos(-1);

inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}

struct Complex{
    db a,b;
    Complex()=default;
    Complex(db a_,db b_):a(a_),b(b_){}
    Complex operator+(const Complex&rhs)const{return Complex(a+rhs.a,b+rhs.b);}
    Complex operator-(const Complex&rhs)const{return Complex(a-rhs.a,b-rhs.b);}
    Complex operator*(const Complex&rhs)const{return Complex(a*rhs.a-b*rhs.b,a*rhs.b+b*rhs.a);}
}f[maxn],g[maxn],h[maxn],w[maxn];

int n,m,r[maxn];

inline void FFT(int L,Complex *f,bool type){
    for(int i=1;i<L;++i){
        r[i]=(r[i>>1]>>1)+(i&1?L>>1:0);
        if(i<r[i]) swap(f[i],f[r[i]]);
    }
    for(int d=1;d<L;d<<=1){
        Complex base=Complex(cos(pi/d),sin(pi/d));
        if(!type) base.b=-base.b;
        w[0]=Complex(1,0);
        for(int i=1;i<d;++i) w[i]=w[i-1]*base;
        for(int i=0;i<L;i+=(d<<1)){
            for(int j=0;j<d;++j){
                Complex x=f[i+j],y=w[j]*f[i+d+j];
                f[i+j]=x+y,f[i+d+j]=x-y;
            }
        }
    }
    if(!type){
        for(int i=0;i<L;++i) f[i].a/=L;
    }
}

int main(){ 
    n=read(),m=read();
    for(int i=0;i<=n;++i) scanf("%Lf",&f[i].a);
    for(int i=0;i<=m;++i) scanf("%Lf",&g[i].a);
    int L=1;
    while(L<=n+m) L<<=1;
    FFT(L,f,1),FFT(L,g,1);
    for(int i=0;i<L;++i) h[i]=f[i]*g[i];
    FFT(L,h,0);
    for(int i=0;i<=n+m;++i){
        printf("%d ",(ll)(h[i].a+0.5));
    }
    printf("\n");
    return 0;
}