import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 typealias Fac = List> typealias Cnt = MutableList class Solver(stream: InputStream, private val out: java.io.PrintWriter) { fun solve() { val N = ni() val M = ni() val K = ni() val op = next() val B = na(M) val A = na(N) if (op == "+") { val C = mutableMapOf() for (i in 0 until M) { val m = B[i] % K C.merge(m, 1, Int::plus) } var ans = 0L for (i in 0 until N) { val mm = A[i] % K val m = (K - mm) % K ans += C.getOrDefault(m, 0) } out.println(ans) } else { val fk = factorize(K).toList() val fkCnt = fk.map{it.second}.toMutableList() debug{fk.toString()} debug{fkCnt.toString()} val C = mutableMapOf() for (i in 0 until M) { val fb = factorize(B[i], fk) C.merge(filter(fb, fkCnt), 1, Int::plus) } debug{C.toString()} var ans = 0L for (i in 0 until N) { val fa = factorize(A[i], fk) val needed = needs(fa, fkCnt) debug{fa.toString()} debug{needed.toString()} C.forEach { if (isSatisfy(it.key, needed)) { ans += it.value } } } out.println(ans) } } fun factorize(a: Int, base: Fac): Cnt { var x = a val res = mutableListOf() for (e in base) { var cnt = 0 for (j in 0 until e.second) { if (x % e.first != 0) break x /= e.first cnt++ } res += cnt } return res } fun factorize(a: Int): MutableMap { val res = mutableMapOf() var x = a loop@while(x > 1) { var i = 2 while(i * i <= x) { if (x % i == 0) { res.merge(i, 1, Int::plus) x /= i continue@loop } i++ } res.merge(x, 1, Int::plus) x = 0 } return res } fun filter(x: Cnt, filter: Cnt): Cnt { val res: Cnt = mutableListOf() for (i in 0 until x.size) { res.add(min(filter[i], x[i])) } return res } fun needs(x: Cnt, target: Cnt): MutableList { val res: Cnt = mutableListOf() for (i in 0 until x.size) { res.add(max(0, target[i] - x[i])) } return res } fun isSatisfy(x: Cnt, needed: Cnt): Boolean { var ok = true for (i in 0 until x.size) { ok = ok and (needed[i] <= x[i]) } return ok } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private val reader = BufferedReader(InputStreamReader(stream), 32768) private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return map(n, offset) { ni() } } private inline fun map(n: Int, offset: Int = 0, f: (Int) -> Int): IntArray { val res = IntArray(n) for (i in 0 until n) { res[i] = f(i + offset) } return res } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } private fun debug(a: LongArray) { debug { a.joinToString(" ") } } private fun debug(a: IntArray) { debug { a.joinToString(" ") } } private fun debug(a: BooleanArray) { debug { a.map { if (it) 1 else 0 }.joinToString("") } } private fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } } fun pair(a: A, b: B) = RPair(a, b) data class RPair(val _1: A, val _2: B) fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }