MOD = 998244353

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    p = int(input[ptr])
    ptr += 1
    A = list(map(int, input[ptr:ptr + p-1]))
    ptr += p-1
    B = list(map(int, input[ptr:ptr + p-1]))
    
    # Precompute modular inverses for 1..p-1
    inv = [0] * p
    for i in range(1, p):
        inv[i] = pow(i, p-2, p)
    
    C = [0] * (p-1)
    for k in range(1, p):
        total = 0
        for i in range(1, p):
            j = (k * inv[i]) % p
            total = (total + A[i-1] * B[j-1]) % MOD
        C[k-1] = total
    
    print(' '.join(map(str, C)))

if __name__ == '__main__':
    main()