#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
const int N = 100010;
int n, p, q, a[N], b[N];
long double ff(long double x) {
  long double mv = 1;
  for (int i = 0; i < n; i++) mv = min(mv, (1 - b[i] * x) / a[i]);
  return mv * p + x * q;
}
int main() {
  scanf("%d%d%d", &n, &p, &q);
  for (int i = 0; i < n; i++) scanf("%d%d", a + i, b + i);
  long double l = 0, r = 1. / (*max_element(b, b + n));
  for (int i = 0; i < 200; i++) {
    long double fl = (l + l + r) / 3, fr = (r + r + l) / 3;
    if (ff(fl) > ff(fr))
      r = fr;
    else
      l = fl;
  }
  printf("%.10f\n", (double)ff((l + r) / 2));
}
