#include <cstdio>
#include <cmath>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <stack>
#include <tuple>
#include <bitset>
#include <time.h>
#include <random>
#define ll long long
#define ull unsigned long long
#define ld long double
#define fp(a, b, c) for (int a = b; a <= c; a++)
#define fd(a, b, c) for (int a = b; a >= c; a--)
#define pii pair<int, int>
#define inf 0x3f3f3f3f3f3f3f3f
#define mod 1000000007
#define eb emplace_back
#define pb pop_back
#define y1 y114
#define y0 y514
#define x1 x114
#define x0 x514
#define mpr make_pair
#define met(x, t) memset(x, t, sizeof(x))
#define fir first
#define sec second
using namespace std;
inline int rd() {
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
	return x * f;
}
const int N = 5e5 + 10;
int n, lenb, lena;
int a[N], b[N], L[N], R1[N], R2[N],vis[N];

struct segment{
	int data[N<<4],tag[N<<4];
	void pushdown(int now,int l,int mid,int r){
		if(tag[now]){
			tag[now<<1]+=tag[now],
			tag[now<<1|1]+=tag[now];
			data[now<<1]+=tag[now]*(mid-l+1),
			data[now<<1|1]+=tag[now]*(r-mid),
			tag[now]=0;
		}
	}
	void pushup(int now){data[now]=min(data[now<<1],data[now<<1|1]);}
	void modify(int now,int l,int r,int ql,int qr,int x){
		if(ql>qr) return; 
		if(ql<=l&&r<=qr) return data[now]+=(r-l+1)*x,tag[now]+=x,void();
		int mid(l+r>>1);
		pushdown(now,l,mid,r);
		if(ql<=mid) modify(now<<1,l,mid,ql,qr,x);
		if(qr>mid) modify(now<<1|1,mid+1,r,ql,qr,x);
		pushup(now);
	}
	int query(int now,int l,int r,int ql,int qr){
		if(ql>qr) return inf;
		if(ql<=l&&r<=qr) return data[now];
		int mid(l+r>>1);
		pushdown(now,l,mid,r);
		if(qr<=mid) return query(now<<1,l,mid,ql,qr);
		else if(ql>mid) return query(now<<1|1,mid+1,r,ql,qr);
		else return min(query(now<<1,l,mid,ql,qr),query(now<<1|1,mid+1,r,ql,qr));
	}
}seg;

void fl() {
	freopen("match.in", "r", stdin);
	freopen("match.out", "w", stdout);
}

signed main() {
	n = rd(), lena = rd(), lenb = rd();
	fp(i, 1, n) a[i] = rd();
	fp(i, 1, n) b[i] = rd();
	sort(a + 1, a + n + 1), sort(b + 1, b + n + 1);
	int j=n;
	fd(i,n,1){
		while(j&&a[j]+lena>=b[i]) j--;
		seg.modify(1,1,n,i,i,i-j-1);
	}
	int last=n,ans=0,p=n;
	fd(i,n,1){
		while(p>=1&&b[p]>a[i]+lenb) p--;
		while(vis[last]) last--;
		if(p&&seg.query(1,1,n,p+1,last)>0&&b[p]>=a[i]){
			seg.modify(1,1,n,p,p,inf);
			seg.modify(1,1,n,p+1,last,-1);
			vis[p]=1,++ans,p--;
		}else vis[last]=1;
	}
	cout << ans << endl;
	return 0;
}
// g++ D.cpp -o D.exe -std=c++14