#include using namespace std; //#include //using multiInt = boost::multiprecision::cpp_int; using ll = long long int; using ld = long double; using pii = pair; using pll = pair; template using smaller_queue = priority_queue, greater>; const int MOD_TYPE = 2; const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); const int INF = (int)1e9; const ll LINF = (ll)4e18; const ld PI = acos(-1.0); const ld EPS = 1e-11; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << endl #define Yes(n) cout << ((n) ? "Yes" : "No") << endl #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl #define possible(n) cout << ((n) ? "possible" : "impossible") << endl #define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << endl; vector Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0}; vector Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0}; int main() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); ll n, m, k; cin >> n >> m >> k; char c; cin >> c; ll ans = 0; vector b(m); rep(i, m) cin >> b[i]; sort(all(b)); rep(i, n) { ll a; cin >> a; auto simulate = [&](ll x) { if (c == '+') return a + b[x] >= k; else return a * b[x] >= k; }; auto binary_search = [&]() { ll lo = -1, hi = m; while (hi - lo > 1) { ll mi = (lo + hi) / 2; if (simulate(mi)) hi = mi; else lo = mi; } return hi; }; ans += m - binary_search(); } cout << ans << endl; return 0; }