#include <bits/stdc++.h>
using namespace std;
int main(){
  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];
  }
  vector<long long> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  sort(A.begin(), A.end());
  sort(B.begin(), B.end());
  long long ans = 0;
  for (int i = 0; i < N; i++){
    int tv = M;
    int fv = -1;
    while (tv - fv > 1){
      int mid = (tv + fv) / 2;
      long long num;
      if (op == '+'){
        num = A[i] + B[mid];
      }
      if (op == '*'){
        num = A[i] * B[mid];
      }
      if (num >= K){
        tv = mid;
      } else {
        fv = mid;
      }
    }
    ans += M - tv;
  }
  cout << ans << endl;
}