#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

#include <map>

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m, k;
    cin, n, m, k;
    char c;
    cin, c;
    vector<ll> B(m), A(n);
    REP(i, 0, m) {
        cin, B[i];
    }
    REP(i, 0, n) {
        cin, A[i];
    }
    if (c == '+') {
        map<ll, ll> mA;
        REP(i, 0, n) {
            A[i] %= k;
            mA[A[i]]++;
        }
        ll ans = 0;
        REP(i, 0, m) {
            B[i] %= k;
            if (B[i] == 0) {
                ans += mA[0];
            }
            ans += mA[k - B[i]];
        }
        print(ans);
    } else {
        map<ll, ll> mA, mB;
        REP(i, 0, n) {
            mA[gcd(A[i], k)]++;
        }
        REP(i, 0, m) {
            mB[gcd(B[i], k)]++;
        }
        ll ans = 0;
        for (auto iA : mA) {
            for (auto iB : mB) {
                if ((iA.first * iB.first) % k == 0) {
                    ans += iA.second * iB.second;
                }
            }
        }
        print(ans);
    }
    return 0;
}