#include <bits/stdc++.h>
using namespace std;
#define N 500005
#define pb push_back
const int up=5e5;
int n,m1,m2,tp,a[N],b[N],s[N],w[N],st[N],dp[N];
vector<int> vc[N];set<int> z;
int main()
{
	scanf("%d %d %d",&n,&m1,&m2);
	for(int i=1;i<=n;++i) scanf("%d",&a[i]);
	for(int i=1;i<=n;++i) scanf("%d",&b[i]),++s[b[i]];
	sort(a+1,a+n+1);for(int i=1;i<=up;++i) s[i]+=s[i-1];
	for(int i=1,t,nw=-1e9;i<=n;++i)
	{
		w[i]=s[a[i]-1]-i+1;nw=max(nw,w[i]);
		t=s[min(a[i]+m1,up)]-nw;if(t<n) vc[t+1].pb(i);
	}z.insert(0);
	for(int i=1,t=0,l,r;i<=n;++i)
	{
		z.insert(i);for(auto j:vc[i]) if(j>=t) z.erase(j);
		while(tp && w[i]>w[st[tp]]) --tp;st[++tp]=i;
		t=s[min(a[i]+m2,up)]-i;l=1;r=tp;
		while(l<=r)
		{
			int mid=(l+r)/2;
			if(t<w[st[mid]]) l=mid+1;else r=mid-1;
		}t=st[r];while(*z.begin()<t) z.erase(z.begin());
		t=*z.begin();dp[i]=t?dp[t-1]+1:0;
	}printf("%d\n",n-dp[n]);return 0;
}