#include <bits/stdc++.h>
 
//#include <unistd.h>
//#include <iostream>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
//#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

void solve1(int n, int m, int k, vi a, vi b) {
	rep (i, n) a[i] %= k;
	rep (j, m) b[j] %= k;
	sort(all(b));

	ll ans = 0;
	rep (i, n) {
		int x = (k - a[i]) % k;
		ans += upper_bound(all(b), x) - lower_bound(all(b), x);
	}
	printf("%lld\n", ans);
}

ll gcd(ll a, ll b) {
  if (b > a) {
	swap(a, b);
  }
  ll r = a%b;
  while (r != 0) {
	a = b;
	b = r;
	r = a%b;
  }
  return b;
}

ll lcm(ll a, ll b) {
  return (a / gcd(a, b))*b;
}

void solve2(int n, int m, int k, vi a, vi b) {
	vi yaku;
	for (ll x = 1; x * x <= k; x++) {
		if (k % x == 0) {
			yaku.push_back(x);
			int y = k / x;
			if (x != y) yaku.push_back(y);
		}
	}
	
	unordered_map<int, int> mp;
	rep (i, m) {
		int x = b[i];
		for (int p: yaku) {
			if (x % p == 0) mp[p]++;
		}
	}

	ll ans = 0;
	rep (i, n) {
		int g = gcd(k, a[i]);
		ans += mp[k / g];
	}
	printf("%lld\n", ans);
}

signed main() {
	fio();
	int n, m, k;
	scanf("%d %d %d\n", &n, &m, &k);
	//assert (k != 735134400);
	char op;
	scanf("%c ", &op);
	vi a(n), b(m);
	rep (i, m) scanf("%d", &b[i]);
	rep (i, n) scanf("%d", &a[i]);
	if (op == '+') solve1(n, m, k, a, b);
	else solve2(n, m, k, a, b);
}