#include <bits/stdc++.h>
using namespace std;

using ll = long long int;

int main(){
    ll n, m, k;
    char op;
    cin >> n >> m >> k >> op;
    vector<ll> a(n), b(m);
    for(int i=0;i<m;i++){
        cin >> b[i];
    }
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    sort(b.begin(), b.end());
    ll cnt = 0;
    for(int i=0;i<n;i++){
        ll x = (op=='+' ? k-a[i] : (k-1)/a[i]+1);
        cnt += m - (lower_bound(b.begin(), b.end(), x) - b.begin());
    }
    cout << cnt << endl;
    return 0;
}