#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 5000
#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;
}
void Adder(int &x,int d)
{
    x=(x<d)?d:x;
    return;
}
int n,ans,la,lb,a[N+1],b[N+1],l[N+1],r1[N+1],r2[N+1],st[N+1],dp[N+1][N+1];
int get_maxn(int sl,int sr)
{
    int maxn=-inf;
    for (int i=sl;i<=sr;++i) maxn=max(maxn,l[i]-i+1);
    return maxn;
}
int main()
{
    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) st[i]=l[i]-i+1;
    for (int i=2;i<=n;++i) st[i]=max(st[i],st[i-1]);
    for (int i=0;i<=n;++i)
	for (int j=0;j<=i;++j)
	    dp[i][j]=-inf;
    dp[0][0]=0;
    for (int i=1;i<=n;++i)
	for (int j=i-1;j>=0;--j)
	{
	    //A
	    Adder(dp[i][i],dp[i-1][j]);
	    //B
	    if (max(r1[j],r2[i])>=st[j]+i&&r2[i]>=get_maxn(j+1,i)+i) Adder(dp[i][j],dp[i-1][j]+1);
	}
    for (int i=0;i<=n;++i) Adder(ans,dp[n][i]);
    printf("%d\n",ans);
    return 0;
}