#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define all(x) x.begin(),x.end()
#define ln '\n'
const long double PI = acos(-1.0L);
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true;} return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true;} return false; }
////////////////////////////////////////////////////////////////////////////////////////////////////////

ll gcd(ll x, ll y) {
    return x ? gcd(y%x,x) : y;
}
int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    ll N,M,K; cin >> N >> M >> K;
    char c; cin >> c;
    vector<ll> B(M),A(N);
    rep(i,M) cin >> B[i];
    rep(i,N) cin >> A[i];

    if (c == '+') {
        ll ans = 0;
        map<ll, ll> dic;
        rep(i,N) dic[A[i]%K]++;
        rep(i,M) ans += dic[(K-B[i]%K)%K];
        cout << ans << ln;
    } else {
        vector<int> C;
        for (int i = 1; i*i <= K; ++i) {
            if (K%i==0) {                
                C.emplace_back(i);
                if (i*i != K) C.emplace_back(K/i);
            }
        }
        ll ans = 0;
        unordered_map<ll, ll> dic;
        rep(i,N) {
            for (auto j : C) {
                if (A[i]%j==0) {
                    dic[j]++;
                }
            }
        }
        rep(i,M) {
            ll p = gcd(K,B[i]);
            ans += dic[K/p];
        }
        cout << ans << ln;
    }
}