#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
   int n, m, k;
   cin >> n >> m >> k;
   
   char op;
   cin >> op;
   
   vector<long long> b(m);
   for (int i = 0; i < m; i++) cin >> b[i];
   
   sort(b.begin(), b.end());
   
   vector<long long> a(n);
   for (int i = 0; i < n; i++) cin >> a[i];
   
   long long ans = 0;
   // op == '+'
    if (op == '+'){
        for (int i = 0; i < n; i++){
            int position = lower_bound(b.begin(), b.end(), k - a[i]) - b.begin();
            ans += m - position;
        }
    }
    else{
        for (int i = 0; i < n; i++){
            int position = lower_bound(b.begin(), b.end(), (k + a[i] - 1) / a[i]) - b.begin();
            ans += m - position;
        }
    }
    cout << ans << endl;
}