#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define ull unsigned long long 
#define sz(a) ((int) a.size())
#define vi vector<int>
#define me(a, x) memset(a, x, sizeof(a))
using namespace std;
const int N = 1 << 20, L = 5e5, mod = 998244353;

int n, la, lb;
int cnta[N], cntb[N];
int a[N], b[N];

multiset < int > st;
int main () { 
	ios :: sync_with_stdio(false);
	cin.tie (0); cout.tie (0);
	cin >> n >> la >> lb;
	L(i, 1, n) {
		cin >> a[i];
	}
	L(i, 1, n) {
		cin >> b[i];
	}
	sort(a + 1, a + n + 1);
	sort(b + 1, b + n + 1);
	int pos = 1;
	vi st;
	
	int ans = 0;
	L(i, 1, n) {
		while(pos <= n && a[pos] <= b[i]) {
			st.emplace_back(a[pos]);
			++pos;
		}
		auto lw = lower_bound(st.begin(), st.end(), b[i] - lb);
		int win = 0;
		if(lw != st.end()) {
			int val = *lw;
			st.erase(lw);
			
			win = 1;
			if(la < L) {
				L(j, 0, sz(st) - 1) {
					if(st[j] + la < b[i + j + 1]) {
						win = 0;
						break;
					}
				}
			}
			if(!win) {
				st.insert(lower_bound(st.begin(), st.end(), val), val);
			} else {
				++ans;
			}
		}
		
		if(!win) {
			st.erase(st.begin());
		}
	}
	cout << ans << '\n';
	return 0;
}