#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;

int main() {
  ll n,m,k;
  cin >> n >> m >> k;
  char op;
  cin >> op;
  vector<ll> a(n),b(m);
  rep(i,m) cin >> b[i];
  rep(i,n) cin >> a[i];
  sort(b.begin(),b.end());

  auto ok = [&](int i,int mid){
    if(op == '+'){
      return a[i] + b[mid] >= k;
    }
    else{
      return a[i] * b[mid] >= k;
    }
  };

  ll ans = 0;
  rep(i,n){
    ll right = -1,left = m;
    while(left - right > 1){
      ll mid = (right + left)/2;
      if(ok(i,mid)) left = mid;
      else right = mid;
    }
    ans += m - left;
  }
  cout << ans << endl;
  return 0;
}