#include <bits/stdc++.h>
using namespace std;
int n;
double p, q, a[100005], b[100005], mx;
double lin(double x) {
  double y = 1;
  for (int i = 1; i <= n; ++i) y = min(y, (1.0 - x * a[i]) / b[i]);
  return p * x + q * y;
}
int main() {
  scanf("%d%lf%lf", &n, &p, &q);
  mx = 1;
  for (int i = 1; i <= n; ++i) {
    scanf("%lf%lf", &a[i], &b[i]);
    mx = min(mx, 1.0 / a[i]);
  }
  double l = 0, r = mx;
  for (int i = 1; i <= 50; ++i) {
    double ll = (r - l) / 3 + l, rr = ll + (r - l) / 3;
    if (lin(ll) > lin(rr))
      r = rr;
    else
      l = ll;
  }
  printf("%.10lf\n", lin((l + r) / 2));
  return 0;
}
