#include <bits/stdc++.h>
using namespace std;
int mysqrt(long long x) {
  int l = 0, r = 1e9 + 1;
  while (r - l > 1) {
    int m = (l + r) / 2;
    if (m * (long long)m <= x)
      l = m;
    else
      r = m;
  }
  return l;
}
mt19937 rnd(1337);
mt19937_64 rndll(12365);
long long AR = 19, BR = 13, CR = 23, XR = 228, YR = 322, MODR = 1e9 + 993;
long long myrand() {
  long long ZR = (XR * AR + YR * BR + CR) % MODR;
  XR = YR;
  YR = ZR;
  return ZR;
}
const int Mod = 1e9 + 7;
int bpow(int x, int y) {
  if (y == 0) return 1;
  if (y == 1) return x;
  int ret = bpow(x, y >> 1);
  ret = (ret * (long long)ret) % Mod;
  if (y & 1) ret = (ret * (long long)x) % Mod;
  return ret;
}
int bdiv(int x, int y) { return (x * (long long)bpow(y, Mod - 2)) % Mod; }
void setmin(int &x, int y) { x = min(x, y); }
void setmax(int &x, int y) { x = max(x, y); }
void setmin(long long &x, long long y) { x = min(x, y); }
void setmax(long long &x, long long y) { x = max(x, y); }
int gcd(int a, int b) { return a ? gcd(b % a, a) : b; }
const long long llinf = 2e18 + 100;
const double eps = 1e-9;
const int maxn = 1e4 + 10, maxw = 1e6 + 100, inf = 2e9 + 100, sq = 300,
          mod = 1e9 + 7, LG = 17;
int N, L, R;
vector<int> a[2];
bitset<maxn> q[2];
int answer;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> N >> L >> R;
  vector<int> visoti(N);
  for (int i = 0; i < N; i++) cin >> visoti[i];
  for (int i = 0; i < N; i++) {
    int tps;
    cin >> tps;
    a[tps].push_back(visoti[i]);
  }
  q[1][0] = 1;
  for (auto i : a[0]) q[1] |= (q[1] << i);
  int S = 0;
  for (auto i : a[1]) S += i;
  sort(a[1].begin(), a[1].end());
  for (int ans = a[1].size() - 1; ans >= 0; ans--) {
    q[0] |= (q[0] << a[1][ans]);
    q[0] |= q[1];
    q[1] |= (q[1] << a[1][ans]);
    S -= a[1][ans];
    for (int i = L; i <= R - S; i++)
      if (q[0][i]) {
        cout << ans + 1;
        return 0;
      }
  }
  cout << 0;
}
