#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define mor > muu & operator<<(
#define ris return *this
#define R22(r) sim> typename enable_if<1 r sizeof(dud<c>(0)),muu&>::type operator<<(c g) {
sim> struct rge {c b, e;};
sim> rge<c> range(c i, c j) {return rge<c>{i, j};}
sim> auto dud(c*r)->decltype(cerr << *r);
sim> char dud(...);
struct muu {
	#ifdef LOCAL
	stringstream a;
	~muu() {cerr << a.str() << endl;}
	R22(<) a << boolalpha << g; ris;}
	R22(==) ris << range(begin(g), end(g));}
	sim mor rge<c> u) {
		a << "[";
		for (c i = u.b; i != u.e; ++i) 
			*this << ", " + 2 * (i == u.b) << *i;
		ris << "]";
	}
	sim, class b mor pair <b,c> r){ris << "(" << r.first << ", " << r.second << ")";}
	#else
	sim mor const c&){ris;}
	#endif
};
#define debug muu() << __FUNCTION__ << "#" << __LINE__ << ": "
#define imie(r...) "[" #r ": " << (r) << "] "
#define range(a, b) "[[" #a ", " #b "): " << range(a, b) << "] "
#define arr(a, i) "[" #a imie(i) ": " << a[i] << "] "
using ll = long long;
using ld = long double;
using pii = pair <int, int>;
ll vec (pii a, pii b) {
	return a.first * 1ll * b.second - a.second * 1ll * b.first;
}
ll sca(pii a, pii b) {
	return a.first * 1ll * b.first + a.second * 1ll * b.second;
}
int main() {
	int n, r;
	pii v;
	scanf("%d%d%d%d", &n, &r, &v.first, &v.second);
	ld rd = r + 1e-4;
	vector <pair <ld, int> > adds;
	for (int i = 0; i < n; ++i) {
		pii p;
		scanf("%d%d", &p.first, &p.second);
		ld pos = sca(v, p) / sqrt(sca(v, v)), dis = abs(vec(v, p)) / sqrt(sca(v, v));
		if (dis < rd) {
			ld off = sqrt(rd * rd - dis * dis);
			debug <<imie(pos) imie(dis) imie(off);
			adds.emplace_back(pos - off, 1);
			adds.emplace_back(pos + off, -1);
		}
	}
	debug << imie(adds);
	sort(adds.begin(), adds.end());
	int curr = 0, ans = 0;
	for (auto x : adds) {
		curr += x.second;
		ans = max(ans, curr);
	}
	printf("%d\n", ans);
}