#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n,la,lb,m = 5e5;
int a[N],b[N];
int val[N];
int sum[N],Mn[N];
vector<pair<int,int> > Chg[N];
struct SGT {
	static const int Sz = N << 2;
	int Mn[Sz],tag[Sz];
	inline void pushup(int k) { Mn[k] = min(Mn[k << 1],Mn[k << 1 | 1]);}
	inline void Add(int k,int v) { Mn[k] += v;tag[k] += v;}
	inline void pushdown(int k) { if(tag[k]) Add(k << 1,tag[k]),Add(k << 1 | 1,tag[k]),tag[k] = 0;}
	void modify(int k,int l,int r,int x,int y,int v) {
		if(x <= l && r <= y) return Add(k,v);
		int mid = l + r >> 1;
		pushdown(k);
		if(x <= mid) modify(k << 1,l,mid,x,y,v);
		if(mid < y) modify(k << 1 | 1,mid + 1,r,x,y,v);
		pushup(k);
	}
	void Change(int k,int l,int r,int pos,int v) {
		if(l == r) { Mn[k] = min(Mn[k],v);return;}
		int mid = l + r >> 1;
		pushdown(k);
		if(pos <= mid) Change(k << 1,l,mid,pos,v);
		else Change(k << 1 | 1,mid + 1,r,pos,v);
		pushup(k);
	}
	int Query(int k,int l,int r,int x,int y) {
		if(x <= l && r <= y) return Mn[k];
		int mid = l + r >> 1;
		pushdown(k);
		if(y <= mid) return Query(k << 1,l,mid,x,y);
		else if(x > mid) return Query(k << 1 | 1,mid + 1,r,x,y);
		else return min(Query(k << 1,l,mid,x,y),Query(k << 1 | 1,mid + 1,r,x,y));
	}
	void build(int k,int l,int r) {
		tag[k] = 0;
		if(l == r) { Mn[k] = 1e9;return;}
		int mid = l + r >> 1;
		build(k << 1,l,mid);build(k << 1 | 1,mid + 1,r);
		pushup(k);
	}
} T;
void updval(int r) {
	if(r < la) return;
	int p1 = upper_bound(a + 1,a + n + 1,r - la) - (a + 1);
	int p2 = upper_bound(a + 1,a + n + 1,r - lb) - (a + 1);
	Chg[p1 + 1].emplace_back(p2,sum[r] - (p1 + 1) + Mn[p1]);
}
int main() {
	cin >> n >> la >> lb;
	for(int i = 1;i <= n;i++) cin >> a[i];
	for(int i = 1;i <= n;i++) cin >> b[i],sum[b[i]]++;
	sort(a + 1,a + n + 1);sort(b + 1,b + n + 1);
	for(int i = 1;i <= m;i++)
		sum[i] += sum[i - 1];
	Mn[0] = 1e9;
	for(int i = 1;i <= n;i++)
		Mn[i] = min(Mn[i - 1],i - sum[a[i] - 1]);
	for(int i = 1;i <= n;i++) updval(a[i] + la),updval(a[i] + lb);
	T.build(1,1,n);
	queue<int> Q;int ans = 0;
	for(int i = 1,j = 1;i <= n;i++) {
		while(j <= n && b[j] <= a[i] + lb) Q.push(b[j++]);
		while(Q.size() && Q.front() < a[i]) Q.pop();
		for(auto [r,v] : Chg[i]) T.Change(1,1,n,r,v);
		if(T.Query(1,1,n,i,n) > 0 && Q.size()) {
			T.modify(1,1,n,i,n,-1);
			Q.pop();++ans;
		}
	}
	cout << ans << endl;
	return 0;
}