#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
ll MOD;
//const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;

char str[5];
void solve()
{
    int n,m,K;
    scanf("%d%d%d", &n, &m, &K);
    scanf("%s", str);
    int flag=(str[0]=='+'? 0: 1);
    vector<int> a(n),b(m);
    int i,j;
    for(i=0; i<m; i++) {
        scanf("%d", &b[i]);
    }
    for(i=0; i<n; i++) {
        scanf("%d", &a[i]);
    }
    sort(a.begin(),a.end());

    ll ans=0;
    for(i=0; i<m; i++) {
        int tmp=(flag==0? K-b[i]: (K-1+b[i])/b[i]);
        int k=lower_bound(a.begin(),a.end(), tmp)-a.begin();
        ans+=(n-k);
    }
    printf("%lld\n", ans);

    return;
}

int main(int argc, char* argv[])
{
#if 1
    solve();
#else
    int T; scanf("%d", &T);
    while(T--) {
        solve();
    }
#endif
    return 0;
}