#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e9
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
#define N 2000005
#define M 2000005
using namespace std;
int n,la,lb;
int a[N],b[N],dp[N],_n;
struct edge
{
	int fm,to,val,cost,nxt;
	edge(int o=0,int a=0,int b=0,int c=0,int d=0)
	{
		fm=o,to=a,val=b,cost=c,nxt=d;
	}
}E[M<<1];
int cnt=1;
int hd[N],dis[N],cur[N],lst[N];
int S,T,ans;
int MC,MF;
int flw[N],ins[N];
void add(int x,int y,int w,int cost)
{
	E[++cnt].to=y;
	E[cnt].fm=x;
	E[cnt].val=w;
	E[cnt].nxt=hd[x];
	E[cnt].cost=cost;
	hd[x]=cnt;
	
	E[++cnt].to=x;
	E[cnt].fm=y;
	E[cnt].val=0;
	E[cnt].nxt=hd[y];
	E[cnt].cost=-cost;
	hd[y]=cnt;
}
bool spfa()
{
	queue<int>q;
	for (int i=1;i<=_n;i++) dis[i]=inf,ins[i]=0,flw[i]=0;
	dis[S]=0;
	q.push(S);
	ins[S]=1;
	flw[S]=inf;
	while (!q.empty())
	{
		int u=q.front();q.pop();
		ins[u]=0;
		for (int i=hd[u];i;i=E[i].nxt)
			if (E[i].val&&dis[E[i].to]>dis[u]+E[i].cost)
			{
				dis[E[i].to]=dis[u]+E[i].cost;
				flw[E[i].to]=min(flw[u],E[i].val);
				lst[E[i].to]=i;
				if (!ins[E[i].to]) ins[E[i].to]=1,q.push(E[i].to);
			}
	}
	if (dis[T]==inf) return 0;
	MF+=flw[T];
	MC+=dis[T]*flw[T];
	int nw=T;
	while (nw!=S)
	{
		E[lst[nw]].val-=flw[T];
		E[lst[nw]^1].val+=flw[T];
		nw=E[lst[nw]].fm;
	}
	return 1;
}	
const int B=100;
void Add(int x,int l,int r,int y)
{
    if (l>r) return;
    // cout<<x<<" "<<l<<" "<<r<<" "<<y<<endl;
    if (r-l+1<=B)
    {
        for (int i=l;i<=r;i++) add(x,i+n,1,-y);
        return;
    }
    add(x,l+2*n,1,-y);
    add(x,r+3*n,1,-y);
    r-=r%B;
    for (int i=l+(B-i%B)%B;i<=r;)
    {
        add(x,i+2*n,1,-y);
        i+=B;
    }
}
void BellaKira()
{
    cin>>n>>la>>lb;
    for (int i=1;i<=n;i++)
        cin>>a[i];
    for (int i=1;i<=n;i++)
        cin>>b[i];
    sort(a+1,a+n+1);
    sort(b+1,b+n+1);
    _n=4*n+2;
    S=4*n+1,T=4*n+2;
    for (int i=1;i<=n;i++)
        add(S,i,1,0),add(i+n,T,1,0);
    for (int i=1;i<=n;i++)
    {
        add(i+2*n,i+n,1,0);
        // cout<<i+2*n<<" "<<i+n<<endl;
        if (i<n&&i%B!=0)
            add(i+2*n,i+1+2*n,inf,0);
    }
    for (int i=1;i<=n;i++)
    {
        add(i+3*n,i+n,1,0);
        // cout<<i+3*n<<" "<<i+n<<endl;
        if (i>1&&i%B!=1)
            add(i+3*n,i-1+3*n,inf,0);
    }
    for (int i=1;i<=n;i++)
    {
        int l=n+1,mid=n+1,r=n+1;
        for (int j=n;j>=1;j--)
        {
            if (b[j]>=a[i]&&b[j]<=a[i]+lb)
            {
                l=j;
            } else
            if (b[j]>=a[i]&&b[j]<=a[i]+la)
            {
                mid=j;
            } else
            if (b[j]>a[i]+la)
                r=j;
        }
        // cout<<i<<" "<<l<<" "<<mid<<" "<<r<<endl;
        Add(i,l,mid-1,1);
        Add(i,mid,r-1,0);
    }
    while (spfa());
    cout<<-MC<<'\n';
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}