#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int gcd(int x, int y) {
	if (y == 0) return x;
	return gcd(y, x % y);
}
int main() {
	int N, M, K; string op;
	cin >> N >> M >> K >> op;
	vector<int> B(M), A(N);
	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;
	sort(A.begin(), A.end());
	sort(B.begin(), B.end());
	if (op == "+") {
		long long ans = 0;
		for (int i = 0; i < N; ++i) {
			int target = (K - A[i]) % K;
			ans += lower_bound(B.begin(), B.end(), target + 1) - lower_bound(B.begin(), B.end(), target);
		}
		cout << ans << endl;
	}
	else {
		vector<int> ds;
		for (int i = 1; i * i <= K; ++i) {
			if (K % i == 0) {
				ds.push_back(i);
				if (i * i != K) ds.push_back(K / i);
			}
		}
		sort(ds.begin(), ds.end());
		vector<int> ca(ds.size()), cb(ds.size());
		for (int i = 0; i < N; ++i) {
			int g = gcd(A[i], K);
			if (g == 0) g = K;
			++ca[lower_bound(ds.begin(), ds.end(), g) - ds.begin()];
		}
		for (int i = 0; i < M; ++i) {
			int g = gcd(B[i], K);
			if (g == 0) g = K;
			++cb[lower_bound(ds.begin(), ds.end(), g) - ds.begin()];
		}
		long long ans = 0;
		for (int i = 0; i < ds.size(); ++i) {
			for (int j = 0; j < ds.size(); ++j) {
				if (1LL * ds[i] * ds[j] % K == 0) {
					ans += 1LL * ca[i] * cb[j];
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}