#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;

int main(){
    int N,M,K;cin>>N>>M>>K;
    char op;cin>>op;
    vector<int> A(N),B(M);
    REP(i,M) cin>>B[i];
    REP(i,N) cin>>A[i];
    ll ans=0;
    sort(All(B));
    if(op=='+'){
        map<int,int> mp;
        REP(i,M) mp[B[i]%K]++;
        REP(i,N) ans+=mp[(K-A[i]%K)%K];
        cout<<ans<<endl;
    }
    else{
        vector<int> d;
        d.reserve(1344);
        for(int i=1;i*i<=K;++i){
            if(K%i==0){
                d.push_back(i);
                if(i*i!=K){
                    d.push_back(K/i);
                }
            }
        }
        sort(All(d));
        int n=d.size();
        vector<int> imos(n);
        REP(i,M) for(int j=n-1;j>=0;--j){
            if(B[i]%d[j]==0){
                imos[n-j-1]++;
                break;
            }
        }
        REP(i,N) REP(j,n){
            if(A[i]%d[j]==0){
                ans+=imos[j];
            }
        }
        cout<<ans<<endl;
    }
}