#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

// 最大公約数
ll gcd(ll m, ll n) {
  if (n == 0) return m;
  else return gcd(n, m % n);
}

int main() {
    int N, M;
    ll K;
    cin >> N >> M >> K;
    vector<ll> A(N);
    ll B[M];
    string op;
    cin >> op;
    map<ll, ll> map_A, map_B;
    map_A[0] = 0;
    map_B[0] = 0;
    for (int i = 0; i < M; i++) {
        cin >> B[i];
        if (map_B.count(B[i] % K)) {
            map_B[B[i] % K]++;
        } else {
            map_B[B[i] % K] = 1;
        }
    }
    for (int i = 0; i < N; i++) {
        cin >> A[i];
        if (map_A[A[i] % K]) {
            map_A[A[i] % K]++;
        } else {
            map_A[A[i] % K] = 1;
        }
    }

    ll sum = 0;
    if (op == "+") {
        for (auto it = map_A.begin(); it != map_A.end(); it++) {
            if (map_B.count((K - it->first) % K)) {
                sum += it->second * map_B[(K - it->first) % K];
            }
        }
    } else {
        map<ll, ll> s, t;
        for (int i = 0; i < N; i++) {
            if (s.count(gcd(K, A[i]))) {
                s[gcd(K, A[i])]++;
            } else {
                s[gcd(K, A[i])] = 1;
            }
        }
        for (int i = 0; i < M; i++) {
            if (t.count(gcd(K, B[i]))) {
                t[gcd(K, B[i])]++;
            } else {
                t[gcd(K, B[i])] = 1;
            }
        }
        for (auto p : s) {
            for (auto q : t) {
                if ((p.first * q.first) % K == 0) {
                    sum += p.second * q.second;
                }
            }
        }
    }
    cout << sum << "\n";
    return 0;
}