# include <bits/stdc++.h>
using namespace std;
int n,a[500010],b[500010],lim[500010],minn[1100000],tag[1100000];
struct BIT
{
	int s[500010];
	void init(){for(int i=1;i<=n;i++) s[i]=i&(-i);}
	void update(int x){for(int i=x;i<=n;i+=i&(-i)) s[i]--;}
	int query(int k)
	{
		int ans=0,cur=0;
		for(int i=__lg(n);i>=0;i--)
			if(ans+(1<<i)<=n && cur+s[ans+(1<<i)]<=k)
				ans+=1<<i,cur+=s[ans];
		return ans;
	}
}B;
void build(int rt,int l,int r)
{
	if(l==r) return minn[rt]=l-lim[l],void();
	int mid=(l+r)/2;
	build(rt*2,l,mid);build(rt*2+1,mid+1,r);
	minn[rt]=min(minn[rt*2],minn[rt*2+1]);
}
void push(int rt,int t){tag[rt]+=t;minn[rt]-=t;}
void pushdown(int rt)
{
	if(!tag[rt]) return;
	push(rt*2,tag[rt]);push(rt*2+1,tag[rt]);
	tag[rt]=0;
}
void update(int rt,int l,int r,int x)
{
	if(l==r) return minn[rt]=1e9,void();
	pushdown(rt);
	int mid=(l+r)/2;
	if(x<=mid) update(rt*2,l,mid,x);
	else update(rt*2+1,mid+1,r,x);
	minn[rt]=min(minn[rt*2],minn[rt*2+1]);
}
void update(int rt,int l,int r,int x,int y)
{
	if(l>y || r<x) return;
	if(x<=l && r<=y) return push(rt,1);
	pushdown(rt);
	int mid=(l+r)/2;
	update(rt*2,l,mid,x,y);update(rt*2+1,mid+1,r,x,y);
	minn[rt]=min(minn[rt*2],minn[rt*2+1]);
}
int query(int rt,int l,int r,int x,int y)
{
	if(l>y || r<x) return 1e9;
	if(x<=l && r<=y) return minn[rt];
	pushdown(rt);
	int mid=(l+r)/2;
	return min(query(rt*2,l,mid,x,y),query(rt*2+1,mid+1,r,x,y));
}
int main()
{
	int La,Lb,ans=0;
	cin>>n>>La>>Lb;
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) scanf("%d",&b[i]);
	sort(a+1,a+n+1);sort(b+1,b+n+1);
	for(int i=1,j=1;i<=n;i++)
	{
		for(;j<=n && b[i]>a[j]+La;j++);
		lim[i]=j;
	}
	B.init();build(1,1,n);
	for(int i=n,j=n;i>=1;i--)
	{
		for(;j && b[j]>a[i]+Lb;j--);
		if(!j || b[j]<a[i]) continue;
		int k=B.query(i);
		if(query(1,1,n,j+1,k)<=0) continue;
		update(1,1,n,j+1,k);update(1,1,n,j);
		B.update(j--);ans++;
	}
	cout<<ans<<endl;
	return 0;
}