#include <bits/stdc++.h>

using namespace std;

inline int rd()
{
	int x=0;bool f=0;char ch=getchar();
	while(ch<'0' || ch>'9') {if(ch=='-') f=1;ch=getchar();}
	while(ch>='0' && ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}

#define x first
#define y second
#define vec vector
#define mp make_pair
#define pb emplace_back
#define upb upper_bound
#define lowb lower_bound
#define isz(x) (int)x.size()
#define gmx(a,b) (a=max(a,b))
#define gmn(a,b) (a=min(a,b))
#define fil(a,x) memset(a,x,sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)

/*

*/

typedef __int128 i128;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef set<int>::iterator iter;
const int N=3e6+10;
const double PI=acos(-1);

int n1,n2,n,bit;
int rev[N];
struct comp {
	double x,y;
	comp operator+(comp b) {return {x+b.x,y+b.y};}
	comp operator-(comp b) {return {x-b.x,y-b.y};}
	comp operator*(comp b) {return {x*b.x-y*b.y,x*b.y+y*b.x};}
}a[N],b[N],w[N];

void FFT(comp a[],int inv) {
	if(inv==-1) for(int i=0;i<n;i++) w[i].y=-w[i].y;
	for(int i=0;i<n;i++) if(rev[i]>i) swap(a[i],a[rev[i]]);
	for(int d=1,t=n>>1;d<n;d<<=1,t>>=1) for(int i=0;i<n;i+=(d<<1)) for(int j=0;j<d;j++) {
		comp v=w[t*j]*a[i+j+d];
		a[i+j+d]=a[i+j]-v;
		a[i+j]=a[i+j]+v;
	}
	if(inv==-1) for(int i=0;i<n;i++) w[i].y=-w[i].y;
}

signed main()
{
	n1=rd(),n2=rd();
	rep(i,0,n1) a[i].x=rd();
	rep(i,0,n2) b[i].x=rd();
	while((1<<bit)<=n1+n2) ++bit,n=1<<bit;
	for(int i=0;i<n;i++) rev[i]=(rev[i>>1]>>1)|((i&1)<<(bit-1));
	for(int i=0;i<n;i++) w[i]={cos(2*i*PI/n),sin(2*i*PI/n)};
	FFT(a,1),FFT(b,1);
	for(int i=0;i<n;i++) a[i]=a[i]*b[i];
	FFT(a,-1);
	rep(i,0,n1+n2) printf("%lld ",(LL)(a[i].x/n+0.5));
	
	return 0;
}