#include <bits/stdc++.h>
using namespace std;
double a[100005], b[100005], p, q, l, r, m1, m2;
int n;
double f(double x) {
  double y = 1e130;
  for (int i = 1; i <= n; i++) {
    y = min(y, (1.0 - a[i] * x) / b[i]);
  }
  return p * x + q * y;
}
int main() {
  scanf("%d%lf%lf", &n, &p, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%lf%lf", &a[i], &b[i]);
  }
  l = 0.0;
  r = 1e130;
  for (int i = 1; i <= n; i++) {
    r = min(r, 1.0 / a[i]);
  }
  while (r - l > 1e-16) {
    m1 = l + (r - l) / 3.0;
    m2 = r - (r - l) / 3.0;
    if (f(m1) < f(m2)) {
      l = m1;
    } else {
      r = m2;
    }
  }
  printf("%.15f\n", f((l + r) / 2));
  return 0;
}
