# 代码

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <set>
#include <map>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<double, double> pdd;
const int N = 105;
const int M = N;
const int E = N * M;

struct Gragh {
struct Edge {
int to, nxt;
Edge(int to, int nxt) : to(to), nxt(nxt) {}
Edge() {}
};

Edge e[E];
bool vis[N];

void addEdge(int from, int to) {
}
void init(int n, int m) {
ec = 0;
for (int i = 0; i <= n; i++) head[i] = -1;
for (int i = 0; i <= m; i++) match[i] = -1;
}
bool dfs(int x) {
vis[x] = true;
for (int i = head[x]; ~i; i = e[i].nxt) {
int to = e[i].to, w = match[to];
if (w == -1 || (!vis[w] && dfs(w))) {
match[to] = x;
return true;
}
}
return false;
}
int bipatiteMatch(int n) {
int ans = 0;
for (int i = 0; i < n; i++) {
memset(vis, 0, sizeof vis);
if (dfs(i)) ans++;
}
return ans;
}
};

inline double sq(double x) {
return x * x;
}
double dis(pdd &a, pdd &b) {
return sqrt(sq(a.fi - b.fi) + sq(a.se - b.se));
}

Gragh g;
pdd a[N], b[N];

int main() {
int n, m, s, v;
while (scanf("%d%d%d%d", &n, &m, &s, &v) == 4) {
s *= v;
g.init(n, m);
for (int i = 0; i < n; i++) {
scanf("%lf%lf", &a[i].fi, &a[i].se);
}
for (int i = 0; i < m; i++) {
scanf("%lf%lf", &b[i].fi, &b[i].se);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (dis(a[i], b[j]) > s) continue;
}
}
printf("%d\n", n - g.bipatiteMatch(n));
}
return 0;
}

02-20 1027
06-02 674

08-16 995
06-29 285
05-27 428
11-17 237
08-10 653
11-13 464
09-11
09-29