#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n, m, k;
  cin >> n >> m >> k;
  char op;
  cin >> op;
  vector<ll> b(m + 2);
  b[0] = -1e18;
  for (int i = 1; i <= m; ++i) {
    cin >> b[i];
  }
  b[m + 1] = 1e18;
  vector<ll> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  sort(b.begin(), b.end());
  ll ans = 0;
  if (op == '+') {
    for (int i = 0; i < n; ++i) {
      int ok = m + 1, ng = 0;
      while (1 < abs(ok - ng)) {
        int mid = (ok + ng) / 2;
        if (k - a[i] <= b[mid]) {
          ok = mid;
        } else {
          ng = mid;
        }
      }
      ans += m - ok + 1;
    }
  } else {
    for (int i = 0; i < n; ++i) {
      int ok = m + 1, ng = 0;
      while (1 < abs(ok - ng)) {
        int mid = (ok + ng) / 2;
        if ((k + a[i] - 1) / a[i] <= b[mid]) {
          ok = mid;
        } else {
          ng = mid;
        }
      }
      ans += m - ok + 1;
    }
  }
  cout << ans << endl;
  return 0;
}