#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main(int argc, char const *argv[]) {
  ll n, m, k;std::cin >> n >> m >> k;
  char c;std::cin >> c;
  vll a(n), b(m);
  get(b);
  get(a);
  sort(all(b));
  ll ans = 0;
  if(c=='+'){
    re(i, n){
      ll tmp = lower_bound(all(b), k-a[i]) - b.begin();
      ans += m - tmp;
    }
  }else{
    re(i, n){
      ll tmp = lower_bound(all(b), k/a[i] + (k%a[i]?1:0)) - b.begin();
      ans += m - tmp;
    }
  }
  std::cout << ans << '\n';
  return 0;
}