#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
const int MOD = ((int)1e9)+7;
const int INF = (int)(1e9)+(int)(1e7);
const ll INFL = (ll)(1e18)+INF;
const double EPS = 1e-8;
using namespace std;
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(A.begin(),A.end());
    sort(B.begin(),B.end());

    rep(i,N){
        int l=-1;int r=M;
        while(r-l>1){
            int mid=(l+r)/2;
            ll val;
            if(op=='+')val=A[i]+B[mid];
            else val = A[i]*B[mid];

            if(val<K)l=mid;
            else r=mid;
        }
        ans+=M-r;
    }
    rep(i,M){
        int l=-1;int r=N;
        while(r-l>1){
            int mid=(l+r)/2;
            ll val;
            if(op=='+')val=B[i]+A[mid];
            else val = B[i]*A[mid];

            if(val<K)l=mid;
            else r=mid;
        }
        ans+=N-r;
    }
    cout << ans/2 << endl;
    return 0;
}