#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 



int main(void){
    int n,m;
    ll k;
    cin>>n>>m>>k;
    char op;
    vector<ll>a(n),b(m);
    ll sum = 0;
    cin>>op;
    for(int i=0;i<m;i++){
        cin>>b[i];
    }
    sort(b.begin(),b.end());
    if(op=='+'){
        ll ans = 0;
        for(int i=0;i<n;i++){
            cin>>a[i];
            auto itr = lower_bound(b.begin(),b.end(),k-a[i]);
            ll index = itr-b.begin();
            ans+=m-index;
        }
        cout<<ans<<endl;
    }
    else{
        ll ans = 0;
        for(int i=0;i<n;i++){
            cin>>a[i];
            ll x= k/a[i]+((k%a[i]==0)?0LL:1LL);
            auto itr = lower_bound(b.begin(),b.end(),x);
            if(itr==b.end()){
                continue;
            }
            ll index = itr-b.begin();
            ans+=m-index;
        }
        cout<<ans<<endl;
    }
    return 0;
}