#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,la,lb;
int a[1000005],b[1000005];
int main(){
	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+1+n);
	int ans=0;
	do{
		int fg=1,s=0;
		for (int i=1;i<=n;i++){
			if (b[i]<a[i]||b[i]>a[i]+la)fg=0;
			if (b[i]>=a[i]&&b[i]<=a[i]+lb)s++;
		}
		ans=max(ans,s);
	}while(next_permutation(a+1,a+1+n));
	cout<<ans<<endl;
	return 0;
}