#include<iostream>
#include<map>
using namespace std;
int N,M;
char op;
long A[1<<17],B[1<<17];
long K,ans;
map<int,int>X;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
main()
{
	cin>>N>>M>>K;
	cin>>op;
	for(int j=0;j<M;j++)
	{
		cin>>B[j];
		X[op=='+'?B[j]%K:gcd(B[j],K)]++;
	}
	if(op=='*')
	{
		for(int i=1;i*i<=K;i++)
		{
			if(K%i==0)X[i]+=0,X[K/i]+=0;
		}
		for(map<int,int>::iterator it=X.begin();it!=X.end();it++)
		{
			int k=it->first,v=it->second;
			for(int i=1;i*i<=k;i++)
			{
				if(k%i==0)
				{
					if(i!=k)X[i]+=v;
					if(k/i!=i&&i!=1)X[k/i]+=v;
				}
			}
		}
	}
	for(int i=0;i<N;i++)
	{
		cin>>A[i];
		ans+=op=='+'?X[(K-A[i]%K)%K]:X[K/gcd(A[i],K)];
	}
	cout<<ans<<endl;
}