#include using namespace std; #define int long long signed main(){ int n, m; cin >> n >> m; int k; cin >> k; char op; cin >> op; int a[100010]; int b[100010]; int sum = 0; for(int i = 0;i < m;i++){ cin >> b[i]; } sort(b, b+m); for(int i = 0;i < n;i++) cin >> a[i]; int ans = 0; for(int i = 0;i < n;i++){ if(op == '+'){ ans += m-(lower_bound(b, b+m, k-a[i])-b); }else{ int l = 0, r = k; while(r-l > 1){ int mid = (l+r)/2; if(mid*a[i] >= k){ r = mid; }else{ l = mid; } } ans += m-(lower_bound(b, b+m, r)-b); } } cout << ans << endl; return 0; }