#include <bits/stdc++.h>
#define int long long
using namespace std;
void solve () {
int n, k, x, p0;
cin >> n >> k >> x >> p0;
vector <int> s (n);
for (int i = 0; i < n; i ++) {
cin >> s[i];
}
vector <int> t (k + 1), p (k + 1);
p[0] = p0;
for (int i = 1; i <= k; i ++) {
cin >> t[i];
}
for (int i = 1; i <= k; i ++) {
cin >> p[i];
}
sort (s.begin (), s.end (), greater ());
int j = 0;
for (int i = 0; i <= k; i ++) {
while (j < n && s[j] * (p[i] - t[i]) >= x) {
j ++;
}
}
cout << j << '\n';
}
signed main () {
ios::sync_with_stdio (false);
cin.tie (nullptr);
int T = 1;
// cin >> T;
while (T --) {
solve ();
}
return 0;
}