package main import ( "sort" "bufio" "fmt" "os" "strconv" ) var sc, wr = bufio.NewScanner(os.Stdin), bufio.NewWriter(os.Stdout) func scanString() string { sc.Scan(); return sc.Text() } func scanInt() int { a,_ := strconv.Atoi(scanString()); return a } func scanInt64() int64 { a,_ := strconv.ParseInt(scanString(),10,64); return a } func scanFloat64() float64 { a,_ := strconv.ParseFloat(scanString(),64); return a } func scanInts(n int) []int { res := make([]int, n); for i := 0; i < n; i++ { res[i] = scanInt() }; return res } func abs(a int) int { if a<0 { return -a }; return a } func min(a,b int) int { if ab { return a }; return b } //•*¨*•.¸¸♪Main•*¨*•.¸¸♪( -ω-)ノ ( ・ω・) func main() { sc.Split(bufio.ScanWords) sc.Buffer(make([]byte, 10000), 1000000) n := scanInt() m := scanInt() k := scanInt() op := scanString() ans := 0 b := scanInts(m) a := scanInts(n) if op == "+" { for i := 0; i < m; i++ { b[i] = b[i]%k } sort.Ints(b) for i := 0; i < n; i++ { a[i] = a[i]%k val := k - a[i]%k l := sort.Search(len(b), func(j int) bool { return val <= b[j] }) r := sort.Search(len(b), func(j int) bool { return val < b[j] }) ans += r-l } } else { kf := factorize(int64(k)) cnt := make(map[int64]int, 0) for i := 0; i < n; i++ { af := factorize(int64(a[i])) v := int64(1) for val, c := range kf { v *= int64(pow(int(val),max(0,c-af[val]))) } cnt[v]++ } // fmt.Println(cnt) for val, c := range cnt { for i := 0; i < m; i++ { if b[i]%int(val) == 0 { ans += c } } } } fmt.Println(ans) } func factorize(n int64) map[int64]int { res := make(map[int64]int, 0) for i := int64(2); i*i <= n; i++ { for n%i == 0 { res[i]++ n /= i } } if n!=1 { res[n] = 1 } return res } func pow(a,n int) int { res := 1 for n>0 { if n&1 == 1 { res *= a } a *= a; n >>= 1 } return res }