#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

int main(void){
    int n,m;
    ll k;
    cin>>n>>m>>k;
    char op;
    vector<ll>a(n),b(m);
    cin>>op;
    map<ll,ll>mb,cnt;
    for(int i=0;i<m;i++){
        cin>>b[i];
        mb[b[i]%k]++;
    }
    map<ll,ll>A,B;
    for(int i=0;i<m;i++){
        ll g = gcd(k,b[i]);
        B[g]++;
    }
    if(op=='+'){
        ll ans = 0;
        for(int i=0;i<n;i++){
            cin>>a[i];
            ll r = a[i]%k;
            ans+=mb[(k-r)%k];
        }
        cout<<ans<<endl;
    }
    else{
        ll ans = 0;
        for(int i=0;i<n;i++){
            cin>>a[i];
            ll g = gcd(k,a[i]);
            A[g]++;
        }
        for(auto itr = A.begin();itr!=A.end();++itr){
            for(auto itr1 = B.begin();itr1!=B.end();++itr1){
                ll x = itr->first;
                ll y = itr1->first;
                if((x*y)%k==0){
                    ans+=(itr->second)*(itr1->second);
                }
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}