拆系数$FFT$（$4$遍$DFT$）

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <algorithm>
#define rin(i,a,b) for(int i=(a);i<=(b);i++)
#define rec(i,a,b) for(int i=(a);i>=(b);i--)
#define trav(i,a) for(int i=head[(a)];i;i=e[i].nxt)
using std::cin;
using std::cout;
using std::endl;
typedef long long LL;

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

const int MAXN=100005;
const int MAXLEN=270005;
const double pi=std::acos(-1);
int n,m;LL MOD;
int len,rev[MAXLEN];
int a[MAXN],b[MAXN];
struct Complex{
	double real,imag;
	inline friend Complex operator + (Complex x,Complex y){
		return (Complex){x.real+y.real,x.imag+y.imag};
	}
	inline friend Complex operator - (Complex x,Complex y){
		return (Complex){x.real-y.real,x.imag-y.imag};
	}
	inline friend Complex operator * (Complex x,Complex y){
		return (Complex){x.real*y.real-x.imag*y.imag,x.real*y.imag+x.imag*y.real};
	}
};
Complex w[MAXLEN];
Complex A[MAXLEN],B[MAXLEN],E[MAXLEN];
Complex AA[MAXLEN],BB[MAXLEN],CC[MAXLEN],DD[MAXLEN];

inline void fft(Complex *c,int dft){
	rin(i,0,n-1) if(i<rev[i])
		std::swap(c[i],c[rev[i]]);
	for(int mid=1;mid<n;mid<<=1){
		int r=(mid<<1),d=dft*(n/r);
		for(int l=0;l<n;l+=r){
			int now=0;
			for(int i=0;i<mid;i++){
				Complex x=c[l+i],y=c[l+mid+i]*w[now];
				c[l+i]=x+y;
				c[l+mid+i]=x-y;
				now+=d;
				if(now<0) now+=n;
			}
		}
	}
	if(dft<0) rin(i,0,n-1)
		c[i].real/=n;
}

int main(){
	n=read(),m=read(),MOD=read();
	rin(i,0,n){
		a[i]=read();
		A[i].real=(a[i]>>15);
		A[i].imag=(a[i]&32767);
	}
	rin(i,0,m){
		b[i]=read();
		B[i].real=(b[i]>>15);
		B[i].imag=(b[i]&32767);
	}
	int nn=n,mm=m;
	m+=n;
	for(n=1;n<=m;n<<=1) len++;
	rin(i,0,n-1) w[i]=(Complex){std::cos(2*pi*i/n),std::sin(2*pi*i/n)};
	rin(i,1,n-1) rev[i]=((rev[i>>1]>>1)|((i&1)<<(len-1)));
	fft(A,1);
	fft(B,1);
	rin(i,0,n-1){
		int ii=(n-i)%n;
		AA[i]=(Complex){(A[i].real+A[ii].real)/2,(A[i].imag-A[ii].imag)/2};
		BB[i]=(Complex){(A[i].imag+A[ii].imag)/2,(A[ii].real-A[i].real)/2};
		CC[i]=(Complex){(B[i].real+B[ii].real)/2,(B[i].imag-B[ii].imag)/2};
		DD[i]=(Complex){(B[i].imag+B[ii].imag)/2,(B[ii].real-B[i].real)/2};
	}
	rin(i,0,n-1){
		E[i]=AA[i]*DD[i]+BB[i]*CC[i];
		A[i]=AA[i]*CC[i]+BB[i]*DD[i]*(Complex){0,1};
	}
	fft(A,-1);
	fft(E,-1);
	std::swap(n,nn);
	std::swap(m,mm);
	rin(i,0,n+m) printf("%lld ",((((LL)(A[i].real+0.5)%MOD)<<30)%MOD+(((LL)(E[i].real+0.5)%MOD)<<15)%MOD+(LL)(A[i].imag/nn+0.5))%MOD);
	printf("\n");
	return 0;
}