#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
	int N, M, K, A;
	char op;
	cin >> N >> M >> K >> op;
	vector<int> B(M);
	for (int& i : B) cin >> i;
	sort(B.begin(), B.end());
	long ans = 0;
	for (int i = 0; i < N; i++) {
		cin >> A;
		if (op == '+') ans += B.end() - lower_bound(B.begin(), B.end(), K - A);
		else ans += B.end() - lower_bound(B.begin(), B.end(), K / A);
	}
	cout << ans;
}