#include <bits/stdc++.h>
#include <atcoder/all>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace atcoder;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vll=vector<ll>;
using vvll=vector<vll>;
using pll=pair<ll,ll>;

// using mint=modint;

// template<class K,class V>
// using ordered_map=tree<K,V,less<K>,rb_tree_tag,tree_order_statistics_node_update>;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    ll N,M,K;
    cin>>N>>M>>K;
    string op;
    cin>>op;
    vll B(M);
    for(int i=0;i<M;++i)cin>>B[i];
    sort(B.begin(),B.end());
    ll ans=0;
    for(int i=0;i<N;++i){
        ll A;
        cin>>A;
        if(A>=K){
            ans+=B.size();
            continue;
        }
        ll need;
        if(op=="+"){
            need=K-A;
        }else{
            need=K/A;
            if(need*A<K)need++;
        }
        auto it=lower_bound(B.begin(),B.end(),need);
        ans+=B.end()-it;
    }
    cout<<ans<<endl;

}