#include <bits/stdc++.h>
using namespace std;
int n, m, p, q;
int a[100010], b[100010];
double pd(double y1) {
  double y2 = 1;
  for (int i = 1; i <= n; i++) y2 = min(y2, (1 - y1 * a[i]) / b[i]);
  return y1 * p + y2 * q;
}
int main() {
  int i, max0;
  double l, r, ll, rr;
  scanf("%d%d%d", &n, &p, &q);
  max0 = 0;
  for (i = 1; i <= n; i++) {
    scanf("%d%d", &a[i], &b[i]);
    if (a[i] >= max0) max0 = a[i];
  }
  l = 0;
  r = 1.0 / max0;
  for (i = 1; i <= 60; i++) {
    ll = l + (r - l) / 3;
    rr = l + (r - l) / 3 * 2;
    if (pd(ll) > pd(rr))
      r = rr;
    else
      l = ll;
  }
  printf("%.15lf", pd(l));
}
