#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b){
	if(b==0) return a;
	return gcd(b, a%b);
}
int main()
{
	int n, m;ll k;
	cin>>n>>m>>k;
	char op; cin>>op;
	ll a[100001], b[100001];
	for(int i=0; i<m; i++) cin>>b[i], b[i]%=k;
	for(int i=0; i<n; i++){
		cin>>a[i];a[i]%=k;
	}
	if(op=='+'){
		ll ans=0;
		sort(b, b+m);
		for(int i=0; i<n; i++){
			int j=lower_bound(b, b+m, (k-a[i])%k)-b;
			int l=upper_bound(b, b+m, (k-a[i])%k)-b;
			ans+=l-j;
		}
		cout<<ans<<endl;
		return 0;
	}
	map<int, ll> mp1, mp2;
	for(int i=0; i<n; i++){
		a[i]=gcd(a[i], k);
		mp1[a[i]]++;
	}
	for(int i=0; i<m; i++){
		b[i]=gcd(b[i], k);
		mp2[b[i]]++;
	}
	ll ans=0;
	for(auto p:mp1){
		for(auto q:mp2){
			if(p.first*q.first%k==0) ans+=p.second*q.second;
		}
	}
	cout<<ans<<endl;
	return 0;
}