#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

vector<ll> divisor(ll n){
    vector<ll> s;
    for(ll i = 2; i*i <= n; i++){
        if(n % i == 0){
            s.push_back(i);
            s.push_back(n/i);
        }
    }
    return s;
}


int main(){
    int N,M,K; cin >> N >> M >> K;
    char op; cin >> op;
    vector<ll> A(N),B(M);
    rep(i,M){
        cin >> B[i];
        B[i] %= K;
    }
    rep(i,N){
        cin >> A[i];
        A[i] %= K;
    }
    map<ll,ll> mp1,mp2;
    rep(i,N){
        mp1[A[i]]++;
    }
    rep(i,M){
        mp2[B[i]]++;
    }
    if(op == '+'){
        ll ans = 0;
        rep(i,N){
            ans += mp2[K-A[i]];
        }
        cout << ans << endl;
    }
    else{
        vector<ll> div = divisor(K);
        ll ans = 0;
        ans += mp1[0]*M+mp2[0]*N-mp1[0]*mp2[0];
        rep(i,N){
            vector<ll> div1 = divisor(A[i]);
            int k = K;
            sort(div1.begin(),div1.end());
            int t = div1.size();
            for(int j = t-1; j >= 0; j--){
                if(k % div1[j] == 0) k /= div1[j];
            }
            for(int u : div){
                if(u % k == 0){
                    ans += mp2[u];
                }
            }

        }
        cout << ans << endl;
    }
    
}