import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

import java.util.*;

public class Main {

    static List<Integer> divisor(int n) {
        List<Integer> list = new ArrayList<Integer>();
        for (int i=1;i<=Math.sqrt(n);i++) {
            if (n%i==0) {
                list.add(i);
                if ((long)i*i!=n) {
                    list.add(n/i);
                }
            }
        }
        Collections.sort(list);
        return list;
    }

    static long gcd(long a,long b) {
        long temp;
        while ((temp=a%b)!=0) {
            a=b;
            b=temp;
        }
        return b;
    }

    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        int N = in.nextInt();
        int M = in.nextInt();
        long K = in.nextInt();
        char op = in.next().charAt(0);
        long[] B = new long[M];
        long[] A = new long[N];
        // long B_sum = 0L;
        // long A_sum = 0L;
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        HashMap<Integer, Integer> mul_map = new HashMap<Integer, Integer>();
        for (int i=0;i<M;i++) {
            B[i] = in.nextLong();
            int remainder = (int)(B[i]%K);
            if (!map.containsKey(remainder)) {
                map.put(remainder, 1);
            } else {
                map.put(remainder, map.get(remainder)+1);
            }

            // int val = K/(int)gcd(K, B[i]);
            int val = (int)gcd(K, B[i]);
            if (!mul_map.containsKey(val)) {
                mul_map.put(val, 1);
            } else {
                mul_map.put(val, mul_map.get(val)+1);
            }
            // B_sum += B[i];
        }

        for (int i=0;i<N;i++) {
            A[i] = in.nextLong();
        }

        HashMap<Integer, Integer> mul_map_A = new HashMap<Integer, Integer>();
        for (int i=0;i<N;i++) {
            // int val = K/(int)gcd(K, A[i]);
            int val = (int)gcd(K, A[i]);
            if (!mul_map_A.containsKey(val)) {
                mul_map_A.put(val, 1);
            } else {
                mul_map_A.put(val, mul_map_A.get(val)+1);
            }
        }

        long ans_plus = 0L;
        long ans_mul = 0L;
        ArrayList<Integer> keys = new ArrayList<Integer>(mul_map.keySet());
        ArrayList<Integer> vals = new ArrayList<Integer>(mul_map.values());


        ArrayList<Integer> keys_A = new ArrayList<Integer>(mul_map_A.keySet());
        ArrayList<Integer> vals_A = new ArrayList<Integer>(mul_map_A.values());

        // out.println(mul_map);
        // out.println(mul_map_A);
        long ans_final = 0;
        for (int i=0;i<keys.size();i++) {
            for (int j=0;j<keys_A.size();j++) {
                // if (K%((long)keys_A.get(j)*keys.get(i))==0) {
                if (((long)keys_A.get(j)*keys.get(i))%K==0) {
                    ans_final += (long)vals_A.get(j)*vals.get(i);
                }
            }
        }

        ArrayList<Integer> diviser = new ArrayList<Integer>(divisor((int)K));
        // out.println(diviser);
        HashMap<Integer, Long> map_map = new HashMap<Integer, Long>();
        for (int i=0;i<diviser.size();i++) {
            for (int j=0;j<keys.size();j++) {
                if (diviser.get(i)%keys.get(j)==0) {
                    if (!map_map.containsKey(diviser.get(i))) {
                        map_map.put(diviser.get(i), (long)vals.get(j));
                    } else {
                        map_map.put(diviser.get(i), (Long)map_map.get(diviser.get(i))+(Integer)vals.get(j));
                    }
                }
            }
        }
        // out.println(map_map);

        for (int i=0;i<N;i++) {
            // A_sum += A[i];
            int val = (int)K-(int)(A[i]%K);
            if (map.containsKey(val)) {
                ans_plus += map.get(val);
            }

            // if (A[i]%K==0) ans_mul+=M;
            // else {
                // int mul_tmp = 0;
                // for (int j=0;j<keys.size();j++) {
                //     if (A[i]%keys.get(j)==0) mul_tmp+=vals.get(j);
                // }
                // ans_mul+=mul_tmp;


                int val_2 = (int)gcd(K, A[i]);
                // out.println("val_2: "+val_2);
                if (map_map.containsKey(val_2)) {
                    ans_mul += map_map.get(val_2);
                }
            // }
        }

        // out.println("K: "+K);
        // out.println(mul_map);
        if (op=='+') out.println(ans_plus);
        // if (op=='*') out.println(ans_mul);
        if (op=='*') out.println(ans_final);
        // out.println(map);
        // Arrays.sort(B);

        // long ans = 0L;
        // for (int i=0;i<N;i++) {
        //     long tmp = 0;
        //     if (op=='+') tmp = K-A[i];
        //     if (op=='*') tmp = (K+A[i]-1)/A[i];
        //     // ans += binary_search(tmp, B, op);
        //     int index = ~Arrays.binarySearch(B, tmp, (o1, o2)->o1>=o2?1:-1);
        //     ans += M-index;
        // }
        // out.println(ans);

        out.close();
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}