#include<bits/stdc++.h>
using namespace std;

using ll=long long;
const int e5=1e5;
const int e9=1e9;

void readnum(int&n,int l,char s){
	int c=getchar();
	assert('1'<=c&&c<='9');
	n=c-'0';
	while(true){
		c=getchar();
		if(c==s)break;
		assert('0'<=c&&c<='9');
		assert(n*10ll+c-'0'<=l);
		n=n*10+c-'0';
	}
}

int gcd(int a,int b){
	return a?gcd(b%a,a):b;
}
ll solve3(int N,int M,int K,int op,vector<int>A,vector<int>B){
	ll z=0;
	if(op=='+'){
		map<int,int>m;
		for(int i=0;i<M;++i){
			++m[B[i]%K];
		}
		for(int i=0;i<N;++i){
			z+=m[(K-A[i]%K)%K];
		}
	}else{
		map<ll,ll>ma,mb;
		for(int i=0;i<N;++i){
			++ma[gcd(K,A[i])];
		}
		for(int i=0;i<M;++i){
			++mb[gcd(K,B[i])];
		}
		for(auto a:ma){
			for(auto b:mb){
				if(a.first*b.first%K==0){
					z+=a.second*b.second;
				}
			}
		}
	}
	return z;
}

int main(){cin.tie(0);ios::sync_with_stdio(false);
	int N,M,K;
	readnum(N,e5,' ');
	readnum(M,e5,' ');
	readnum(K,e9,'\n');
	int op=getchar();
	assert(op=='+'||op=='*');
	int c=getchar();
	assert(c==' ');
	vector<int>A(N),B(M);
	for(int i=0;i<M;++i){
		readnum(B[i],e9," \n"[i==M-1]);
	}
	for(int i=0;i<N;++i){
		readnum(A[i],e9,'\n');
	}
	c=getchar();
	assert(c==-1);
	cout<<solve3(N,M,K,op,A,B)<<"\n";
	return 0;
}