def solve():
    n, m, k = map(int, input().split())
    op, *B = input().split()
    B = list(map(int, B))
    A = list(int(input()) for _ in range(n))
    sum_b = sum(B)
    def f(op, a, b):
        if op == "*":
            return (a * b) % k
        return (a * m + b) % k
    ans = 0
    for i in range(n):
        ans += f(op, A[i], sum_b)
    print(ans % k)
solve()