import java.util.* import java.io.PrintWriter val pw = PrintWriter(System.out) val MOD = 1000000007L val INF = 2147483647 val LINF = 9223372036854775807L fun main(args: Array){ solve() pw.flush() } fun solve(){ val (n, m, k) = nextIntList() val list = nextList() val op = list.first() val b = list.drop(1).map{ it.toLong() } val bsum = b.sum() val a = nextLongAryln(n) var ans = 0L if(op.equals("+")){ for (i in a.indices) { ans = (ans + a[i] * m.toLong() + bsum) % k.toLong() } } else { for (i in a.indices) { ans = (ans + a[i] * bsum) % k.toLong() } } println(ans) } // Print fun println(v: String){ pw.println(v) } fun print(v: String){ pw.print(v) } // Read fun next() = readLine()!! fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextDouble() = next().toDouble() fun nextList() = next().split(" ") fun nextIntList() = next().split(" ").map{ it.toInt() } fun nextLongList() = next().split(" ").map{ it.toLong() } fun nextDoubleList() = next().split(" ").map{ it.toDouble() } fun nextAryln(n: Int) = Array(n){ next() } fun nextIntAryln(n: Int) = IntArray(n){ nextInt() } fun nextLongAryln(n: Int) = LongArray(n){ nextLong() } fun nextDoubleAryln(n: Int) = DoubleArray(n) { nextDouble() } // Math fun abs(n: Int) : Int = Math.abs(n) fun abs(n: Long) : Long = Math.abs(n) fun abs(n: Double) : Double = Math.abs(n) fun max(a: Int = -INF, b: Int = -INF, c: Int = -INF, d: Int = -INF, e: Int = -INF): Int = listOf(a, b, c, d, e).max()!! fun max(a: Long = -LINF, b: Long = -LINF, c: Long = -LINF, d: Long = -LINF, e: Long = -LINF): Long = listOf(a, b, c, d, e).max()!!.toLong() fun min(a: Long = LINF, b: Long = LINF, c: Long = LINF, d: Long = LINF, e: Long = LINF): Long = listOf(a, b, c, d, e).min()!!.toLong() fun prime(from: Long, to: Long = from) : List{ return (from..to).filter{ i -> val max = Math.sqrt(i.toDouble()).toLong() (2..max).all{ j -> i % j != 0L} } } fun gcd(a: Long, b: Long) : Long = if(a % b == 0L) b else gcd(b, (a % b)) fun lcm(a: Long, b: Long) : Long = a / gcd(a, b) * b fun modpow(a: Long, n: Long, p:Long = MOD) : Long { var res = 1L var ar = a var nr = n while(nr > 0){ if((nr and 1) == 1L) res = res * ar % p ar = ar * ar % p nr = nr shr 1 } return res } fun modinv(a: Long, p: Long = MOD) : Long = modpow(a, p - 2, p) fun ncr(n: Long, r: Long) : Long { var a = 1L var b = 1L for (i in 1..r) { a = a * (n + 1 - i) % MOD b = b * i % MOD } return modinv(b, MOD) * a % MOD }