#include #define rep(i,n) for(int i = 0; i < (n); i++) using namespace std; typedef long long ll; int main(){ cin.tie(0); ios::sync_with_stdio(0); ll N,M,K; cin >> N >> M >> K; char op; cin >> op; vector A(N), B(M); rep(i,M) cin >> B[i]; rep(i,N) cin >> A[i]; sort(A.begin(), A.end()); sort(B.begin(), B.end()); ll ans = 0; rep(i,N) { ll x = (op == '+' ? K - A[i] : (K + A[i] - 1) / A[i]); ans += B.end() - lower_bound(B.begin(), B.end(), x); } cout << ans << endl; }