hdu6061[NTT推公式] 2017多校3

/*hdu6061[NTT推公式] 2017多校3*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = ;
const int MAX_N = ;
int n, m, temp;
LL a;
LL inv[];
LL Finv[];
LL F[];
LL A[], B[], C[];
LL quickPow(LL x, LL n, LL MOD) {
    LL ans = ;
    for (; n; n >>= ) {
        if (n & ) ans = (ans * x) % MOD;
        x = (x * x) % MOD;
    }
    return ans;
}

void inv_init() {
    inv[] = ;
    for (int i = ; i <= MAX_N; ++i) {
        inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
    }
    F[] = Finv[] = ;
    for (int i = ; i <= MAX_N; ++i) {
        F[i] = F[i - ] * 1LL * i % MOD;
        Finv[i] = Finv[i - ] * 1LL * inv[i] % MOD;
    }
}
/*
ntt.run(a, len, 1, MOD);
ntt.run(b, len, 1, MOD);
REP(0, len) c[i] = a[i] * b[i] % MOD;
ntt.run(c, len, -1, MOD);
*/
struct NTT {
    enum {g = };
    // @private
    int rev(int x, int r) {
        int ans = ;
        for (int i = ; i < r; i++) {
            if (x & ( << i)) ans +=  << (r - i - );
        }
        return ans;
    }
    // @public
    void run(LL a[], int n, int on, LL MOD) {
        int r = (int)log2(n + 1e-);
        for (int i = ; i < n; i++) {
            int tmp = rev(i, r);
            if (i < tmp) swap(a[i], a[tmp]);
        }
        for (int s = ; s <= r; s++) {
            int m =  << s;
            LL wn = quickPow(g, (MOD - ) / m, MOD);
            for (int k = ; k < n; k += m) {
                LL w = ;
                for (int j = ; j < (m >> ); j++) {
                    LL t = w * (a[k + j + (m >> )] % MOD) % MOD, u = a[k + j] % MOD;
                    a[k + j] = (u + t) % MOD;
                    a[k + j + (m >> )] = ((u - t) % MOD + MOD) % MOD;
                    w *= wn; w %= MOD;
                }
            }
        }
        if (on < ) {
            for (int i = ; i < (n >> ); i++) swap(a[i], a[n - i]);
            LL inv = quickPow(n, MOD - , MOD);
            for (int i = ; i < n; i++) a[i] = a[i] % MOD * inv % MOD;
        }
    }
} ntt;
int main() {
    inv_init();
    while (~scanf("%d", &n)) {
        a = ;
        for (int i = ; i <= n; i++) {
            scanf("%lld", &C[i]);
        }
        scanf("%d", &m);
        for (int i = ; i < m; i++) {
            scanf("%d", &temp);
            a -= temp;
            if (a <= ) a += MOD;
        }
        LL temp = 1LL;
        int len = ; while (len < ( * n)) len <<= ;
        for (int i = ; i < len; i++) {
            if (i <= n) {
                A[i] = temp * Finv[i] % MOD;
                B[i] = F[n - i] * C[n - i] % MOD;
            }
            else A[i] = B[i] = ;
            temp = (temp * a) % MOD;
        }
        ntt.run(A, len, , MOD);
        ntt.run(B, len, , MOD);
        for (int i = ; i < len; i++) {
            A[i] = (A[i] * B[i]) % MOD;
        }
        ntt.run(A, len, -, MOD);
        for (int i = ; i <= n; i++) {
            //cout << A[i] << endl;
            A[i] = (A[i] % MOD + MOD) % MOD * Finv[n - i] % MOD;
        }
        for (int i = ; i <= n; i++) {
            printf("%lld ", A[n - i]);
        }
        puts("");
    }
    return ;
}