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

#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

void Main()
{
    int n, m;
    ll k;
    cin >> n >> m >> k;
    char op;
    cin >> op;
    vll b(m), a(n);
    rep(j,m) cin >> b[j];
    rep(i,n) cin >> a[i];
    sort(all(a));
    sort(all(b));

    ll ans = 0;
    int l, mid, r;
    // 2 次元の 2 分探索？
    if(op == '+'){
        rep(i,n){
            l = 0; 
            r = m-1;
            if(a[i] + b[l] >= k){
                ans += m;     
            }else if(a[i] + b[r] < k){
                ;
            }else{
                while(l+1 != r){
                    mid = (l+r)/2;
                    if(a[i] + b[mid] >= k){
                        r = mid;
                    }else{
                        l = mid;
                    }
                }
                ans += (m-r);
            }
        }
    }

    else if(op == '*'){
        rep(i,n){
            l = 0; 
            r = m-1;
            if(a[i] * b[l] >= k){
                ans += m;     
            }else if(a[i] * b[r] < k){
                ;
            }else{
                while(l+1 != r){
                    mid = (l+r)/2;
                    if(a[i] * b[mid] >= k){
                        r = mid;
                    }else{
                        l = mid;
                    }
                }
                ans += (m-r);
            }
        }
    }
    
    cout << ans << endl;
	return;
}

int main()
{
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(15);
	Main();
	return 0;
}