#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;

ll gcd(ll a, ll b){
    return b==0 ? a : gcd(b, a%b);
}

int main(){
    int n, m, k;
    char op;
    cin >> n >> m >> k >> op;
    vector<ll> b(m), a(n);
    for(int i = 0; i < m; i++)  cin >> b[i];
    for(int i = 0; i < n; i++)  cin >> a[i];
    ll ret = 0;
    if(op == '+'){
        map<int,int> cnt;
        for(int i = 0; i < m; i++)  cnt[b[i]%k]++;
        for(int i = 0; i < n; i++)  ret += cnt[(k-a[i]%k)%k];
    }else if(op == '*'){
        vector<int> fact;
        for(ll i = 1; i*i <= k; i++){
            if(k%i) continue;
            fact.push_back(i);
            if(i != k/i)    fact.push_back(k/i);
        }
        vector<int> v;
        for(int j : fact){
            int tmp = 0;
            for(int i = 0; i < m; i++)  if(b[i]%j==0)   tmp++;
            v.push_back(tmp);
        }
        map<int,int> cnt;
        for(int i = 0; i < fact.size(); i++)    cnt[fact[i]] = v[i];
        for(int i = 0; i < n; i++){
            ll g = gcd(k, a[i]);
            g = k/g;
            ret += cnt[g];
        }
    }
    cout << ret << endl;
    return 0;
}