#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);


vector<ll> enum_div(int n){//yakusu
	vector<ll> ret;
	for(ll i=1 ; i*i<=n ; ++i){
			if(n%i == 0){
				ret.push_back(i);
				if(i*i!=n)ret.push_back(n/i);
			}
	}
	return ret;
}



int main(){
	ll N,M,K;
	cin >> N >> M >> K;
	ll ans=0;
	vector<ll> A(N),B(M);
	char op;
	cin >> op;
	FOR(i,0,M)cin>>B[i];
	FOR(i,0,N)cin>>A[i];
	map<ll,ll> Bmod;
	FOR(i,0,M)Bmod[B[i]%K]++;
	FOR(i,0,N){
		if(op=='+'){
			ll x = (K-A[i]%K)%K;;
			ans += Bmod[x];
		}
	}

	auto y = enum_div(K);
	sort(y.begin(), y.end());
	reverse(y.begin(), y.end());
	map<ll,ll> a_div,b_div;
	for(auto x:y){
		vector<ll> anex;
		for(auto a:A){
			if(a%x==0){
				a_div[x]++;
			}else{
				anex.push_back(a);
			}
		}
		A = anex;
	}

	for(auto x:y){
		vector<ll> bnex;
		for(auto b:B){
			if(b%x==0){
				b_div[x]++;
			}else{
				bnex.push_back(b);
			}
		}
		B = bnex;
	}
	if(op=='*')for(auto a:a_div){
		for(auto b:b_div){
			if(a.first*b.first%K==0){
				ans += a.second*b.second;
			}
		}
	}
	cout << ans << endl;
}