#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 500000
#define inf 1e9
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int n,ans,la,lb,a[N+1],b[N+1],l[N+1],r1[N+1],r2[N+1];
int main()
{
    int res=-inf;
    n=read(),la=read(),lb=read();
    for (int i=1;i<=n;++i) a[i]=read();
    for (int i=1;i<=n;++i) b[i]=read();
    sort(a+1,a+n+1),sort(b+1,b+n+1);
    for (int i=1;i<=n;++i) l[i]=lower_bound(b+1,b+n+1,a[i])-b-1,r1[i]=lower_bound(b+1,b+n+1,a[i]+la+1)-b-1,r2[i]=lower_bound(b+1,b+n+1,a[i]+lb+1)-b-1;
    for (int i=1;i<=n;++i)
    {
	if (r2[i]-i>=res) ans++; 
	res=max(res,l[i]-i+1);
    }
    printf("%d\n",ans);
    return 0;
}