#include <bits/stdc++.h>
using namespace std;
int n, p, q, a[100100], b[100100];
long double call(long double x2) {
  long double x1 = 1;
  for (int i = 1; i <= n; i++) x1 = min(x1, (1 - x2 * b[i]) / a[i]);
  return (x1 * p + x2 * q);
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> p >> q;
  for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
  long double l = 0, r = 1.0 / *max_element(b + 1, b + n + 1);
  for (int i = 1; i <= 200; i++) {
    long double nl = l + (r - l) / 3;
    long double nr = r - (r - l) / 3;
    long double fl = call(nl);
    long double fr = call(nr);
    if (fl > fr)
      r = nr;
    else
      l = nl;
  }
  printf("%.10f", (double)call((l + r) / 2));
  return 0;
}
