#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

// #include <sys/time.h>
ll getTimeUS() {
  struct timeval tv;
  gettimeofday(&tv, NULL);
  return (ll)tv.tv_sec*1000000+(ll)tv.tv_usec;
}

int drawcard(int *card, int p, int n) {
  int minp = 0;
  for (int i = 1; i < n; i++) {
    if (card[i] < card[minp]) {
      minp = i;
    }
  }

  if (n == 1) {
    return 0;
  }else if (rand()%1000 < p) {
    return minp;
  }else {
    swap(card[minp], card[n-1]);
    return rand()%(n-1);
  }
}

int main() {
  ll startT = getTimeUS();

  int n;
  cin >> n;
  double ta, tb;
  cin >> ta >> tb;
  int pa = ta*1000, pb = tb*1000;
  int a[n], b[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }

  double cnt1, cnt2;
  cnt1 = cnt2 = 0;
  while (getTimeUS()-startT < 1000000*3-100000) {
    int suma, sumb;
    suma = sumb = 0;
    for (int i = 0; i < n; i++) {
      int carda, cardb;
      int p;
      p = drawcard(a, pa, n-i);
      carda = a[p];
      swap(a[p], a[n-1-i]);
      p = drawcard(b, pb, n-i);
      cardb = b[p];
      swap(b[p], b[n-1-i]);
      if (carda < cardb) {
	sumb += carda+cardb;
      }else {
	suma += carda+cardb;
      }
    }
    if (suma > sumb) {
      cnt1++;
    }
    cnt2++;
  }
  std::cout << cnt1/cnt2 << std::endl;
}