#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
  int x = 0; bool op = 0;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 1e6 + 10;
const int INF = 1e9;
int n, la, lb;
int a[N], b[N], cnt[N], mn[N], lim[N];
int main() { 
  n = read(); la = read(); lb = read();
  for(int i = 1; i <= n; i++)a[i] = read();
  for(int i = 1; i <= n; i++)b[i] = read(), cnt[b[i]]++;
  for(int i = 1; i < N; i++)cnt[i] += cnt[i - 1];
  sort(a + 1, a + 1 + n);
  sort(b + 1, b + 1 + n);
  for(int i = 1; i <= n; i++) {
    int sum = 0; mn[i] = INF;
    for(int j = 1; j <= i; j++) {
      if(a[j] + la <= a[i] + lb) {
        sum++;
        mn[i] = min(mn[i], (cnt[a[i] + lb] - cnt[a[j] - 1]) - sum);
      }
    }
  }
  for(int i = 1; i <= n; i++)lim[i] = INF;
  multiset<int> s;
  int ans = 0;
  for(int i = n, j = n; i; i--) {
    while(b[j] >= a[i])s.insert(b[j--]);
    for(int j = 1; j <= i; j++) {
      if(a[j] + la > a[i] + lb) {
        lim[j] = min(lim[j], mn[i]);
        break;
      }
    }
    int flg = 1;
    for(int j = 1; j <= n; j++)if(!lim[j])flg = 0;
    if(flg) {
      auto it = s.upper_bound(a[i] + lb);
      if(it != s.begin())ans++, s.erase(--it);
      for(int j = i; j; j--)lim[j]--;
    }
  }
  printf("%d\n", ans);
  return 0;
}