#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

int main() {
  ll n, m, k;
  cin >> n >> m >> k;

  char op;
  cin >> op;
  vector<ll> b(m), a(n);
  rep(i,m) cin >> b[i];
  rep(i,n) cin >> a[i];

  sort(b.begin(), b.end());
  ll ans = 0;
  rep(i,n) {
    if (op == '+') {
      int id = lower_bound(b.begin(), b.end(), k-a[i]) - b.begin();
      ans += m-id;
    } else {
      int id = lower_bound(b.begin(), b.end(), (k+a[i]-1)/a[i]) - b.begin();
      ans += m-id;
    }
  }
  cout << ans << endl;

}