rt，经过调试确认问题在 Poly::Get() 上，其它部分就是按三个模数做多项式乘法。

求调，或者照我的变量名给我一个正确的写法也行，thx

求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了求你了%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;

inline int fsp(int x, int p, int Mod) {
	int res = 1;
	for (; p; p >>= 1) {
		if (p & 1) res = res * x % Mod;
		x = x * x % Mod;
	}
	return res;
}

const int MAXN = 400005;

int n, m, Mod;
int a[MAXN], b[MAXN];

namespace Poly {
	const int G = 3;
	const int P[3] = {998244353, 1004535809, 469762049};
	int n, rev[MAXN], inv[3];
	inline void Init(int lenght) {
		int len = 1, l = -1;
		while (len < lenght) len <<= 1, ++ l;
		n = len;
		for (int i = 0; i < 3; ++ i) inv[i] = fsp(n, P[i] - 2, P[i]);
		for (int i = 1; i <= len; ++ i)
			rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << l);
	}
	inline void NTT(int a[], int sgn, int t) {
		int Mod = P[t];
		for (int i = 1; i <= n; ++ i)
			if (i < rev[i]) swap(a[i], a[rev[i]]);
		for (int flr = 2; flr <= n; flr <<= 1) {
			int Wn = fsp((sgn == 1) ? G : (Mod + 1) / G, (Mod - 1) / flr, Mod);
			for (int mid = flr >> 1, l = 0; l < n; l += flr) {
				int w = 1, x, y;
				for (int i = l; i < l + mid; ++ i, w = w * Wn % Mod)
					x = a[i], y = w * a[i + mid] % Mod, 
					a[i] = (x + y) % Mod, a[i + mid] = (x - y + Mod) % Mod;
			}
		}
		if (!~sgn) 
			for (int i = 0; i < n; ++ i)
				a[i] = a[i] * inv[t] % Mod;
	}
	int t[3][MAXN];
	inline int Get(int x1, int x2, int x3, int Mod) {
		int k1 = (x2 - x1 + P[1]) % P[1] * fsp(P[0], P[1] - 2, P[1]) % P[1];
		int x4 = (x1 + k1 * P[0] % P[2]) % P[2];
		int k4 = (x3 - x4 + P[2]) % P[2] * fsp(P[0] * P[1] % P[2], P[2] - 2, P[2]) % P[2];
//		printf ("%lld %lld %lld\n", k1, x4, k4);
		return (x4 + k4 * P[0] % Mod * P[1] % Mod) % Mod;
	}
	inline void Mul(int len, int a[], int b[], int c[]) {
		Init(len);
		for (int i = 0; i < 3; ++ i) {
			NTT(a, 1, i); if (&a != &b) NTT(b, 1, i);
			for (int j = 0; j < n; ++ j)
				t[i][j] = a[j] * b[j] % P[i];
			NTT(a, -1, i); if (&a != &b) NTT(b, -1, i);
			NTT(t[i], -1, i);
		}
		for (int i = 0; i < n; ++ i)
			c[i] = Get(t[0][i], t[1][i], t[2][i], Mod);
	}
}

signed main()
{
	scanf ("%lld%lld%lld", &n, &m, &Mod);
	++ n, ++ m;
	for (int i = 0; i < n; ++ i) scanf ("%lld", a + i);
	for (int i = 0; i < m; ++ i) scanf ("%lld", b + i);
	Poly::Mul(n + m, a, b, a);
	for (int i = 0; i < n + m - 1; ++ i) printf ("%lld ", a[i]);
	return puts(""), 0;
}