#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    ll K;
    cin >> K;
    char op;
    cin >> op;
    vector<ll> b(m);

    for (int i = 0; i < m; ++i) {
        cin >> b[i];
    }
    sort(b.begin(), b.end());

    vector<ll> a(n);

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());

    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        if (op == '+') {
            int num = b.end() - lower_bound(b.begin(), b.end(), K - a[i]);
            ans += num;
        } else {
            int num = b.end() - lower_bound(b.begin(), b.end(), (K + a[i] - 1) / a[i]);
            ans += num;            
        }
    }
    cout << ans << "\n";
    return 0;
}