#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll n,m,k;cin>>n>>m>>k;
    vector<ll> b(m),a(n);
    char op;cin>>op;
    rep(i,m) cin>>b[i];
    rep(i,n) cin>>a[i];

    auto solveplus=[&](){
        map<ll,ll> mp;
        rep(i,n) mp[a[i]%k]++;
        ll ans=0;
        rep(i,m){
            ll t=(k-b[i]%k)%k;
            ans+=mp[t];
        }
        cout<<ans<<endl;
    };
    auto solvemulti=[&](){
        map<ll,ll> ca,cb;
        rep(i,n) ca[gcd(a[i],k)]++;
        rep(i,m) cb[gcd(b[i],k)]++;
        ll ans=0;
        for(auto pa:ca){
            for(auto pb:cb){
                if(pa.first*pb.first%k==0){
                    ans+=pa.second*pb.second;
                }
            }
        }
        cout<<ans<<endl;
    };
    if(op=='*') solvemulti();
    else solveplus();
    return 0;
}