#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;

int main(){
    int 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];
    ll ans=0;
    sort(All(B));
    if(op=='+'){
        REP(i,N){
            ans+=B.end()-lower_bound(All(B),K-A[i]);
        }
        cout<<ans<<endl;
    }
    else{
        REP(i,N){
            ans+=B.end()-lower_bound(All(B),(K+A[i]-1)/A[i]);
        }
        cout<<ans<<endl;
    }
}