#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i,n) for(long long i=0; i<n; i++)
#define repr(i,n,m) for(long long i=m; i<n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) for (auto&& itr : x) { cerr << (itr) << " "; }

template <class T> inline void chmax(T &ans, T t) { if (t > ans) ans = t;}
template <class T> inline void chmin(T &ans, T t) { if (t < ans) ans = t;}

inline ll cel(ll t, ll m) {
  ll res = 0;
  res = t / m;
  if (t % m != 0) {
    res += 1;
  }

  return res;
}

int main() {
  ll n, m, k;
  string op;
  cin >> n >> m >> k >> op;
  vector<ll> b(m), a(n);
  rep(i, m) cin >> b[i];
  rep(i, n) cin >> a[i];

  sorti(b);

  ll ans = 0;
  for (auto&& itr : a) {
    ll tmp = 0;
    if (op == "+") {
      tmp = k - itr;
    } else {
      tmp = cel(k, itr);
    }

    auto it = lower_bound(b.begin(), b.end(), tmp);
    auto dis = b.end() - it;
    ans += dis;
  }

  cout << ans << endl;
}