#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

// long version
long long int GCD(long long int x, long long int y){
    if(x>y){
        long long int swap = x;
        x = y;
        y = swap;
    }
    while(true){
        if(y%x==0){
            return x;
        }else{
            long long int amari = y%x;
            y = x;
            x = amari;
        }
    }
}

int main() {
    ll n, m;
    cin >> n >> m;
    ll k;
    cin >> k;
    char op;
    cin >> op;
    ll a[n], b[m];
    rep(i,m)cin >> b[i];
    rep(i,n)cin >> a[i];

    sort(a,a+n);
    sort(b,b+m);

    ll ans = 0;
    
    if(op == '+'){
        rep(i,n)a[i] %= k;
        rep(j,m)b[j] %= k;
        sort(a,a+n);
        sort(b,b+m);
        rep(i,n){
            if(a[i] == 0){
                ans += (int)(lower_bound(b,b+m,1) - lower_bound(b,b+m,0));
            }else{
                ans += (int)(lower_bound(b,b+m,k-a[i]+1) - lower_bound(b,b+m,k-a[i]));
            }
        }
    }else{
        rep(i,n) a[i] = GCD(k, a[i]);
        rep(i,m) b[i] = GCD(b[i], k);
        map<ll,ll> mp1, mp2;
        rep(i,n)mp1[a[i]]++;
        rep(i,m)mp2[b[i]]++;
        for(auto x : mp1){
            for(auto y : mp2){
                if(x.first*y.first%k == 0){
                    ans += x.second * y.second;
                }
            }
        }
    }
    
    cout << ans << endl;
    return 0;
}