#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

int main() {
    ll n, m, k;
    cin >> n >> m >> k;
    char op;
    cin >> op;
    vector<ll> a(n), b(m);
    for (int i = 0; i < m; i++)cin >> b[i];
    for (int i = 0; i < n; i++)cin >> a[i];
    sort(a.begin(), a.end()), sort(b.begin(), b.end());

    ll ret = 0;
    for (int i = 0; i < n; i++) {
        int ng = -1, ok = m;
        while (ok - ng > 1) {
            int mid = (ok + ng) / 2;
            if (op == '+') {
                if (a[i] + b[mid] < k)ng = mid;
                else ok = mid;
            } else {
                if (a[i] * b[mid] < k)ng = mid;
                else ok = mid;
            }
        }
        ret += m - ok;
    }

    cout << ret << endl;
    return 0;
}