#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;
}
int n, p, q, c, d, maxY;
vector<pair<int, int> > points;
double getMax(double y2) {
  double y1 = 10000000;
  for (int i = 0; i < (int)n; i++) {
    y1 = min(y1, (1 - points[i].second * y2) / double(points[i].first));
  }
  return y1 * p + y2 * q;
}
int main() {
  maxY = 0;
  scanf("%d%d%d", &n, &p, &q);
  for (int i = 0; i < (int)n; i++) {
    scanf("%d%d", &c, &d);
    points.push_back(make_pair(c, d));
    maxY = max(maxY, d);
  }
  double s = 0, e = 1 / double(maxY);
  for (int i = 0; i < (int)100; i++) {
    double mid1 = (s * 2 + e) / 3.;
    double mid2 = (s + e * 2) / 3.;
    if (getMax(mid1) > getMax(mid2))
      e = mid2;
    else
      s = mid1;
  }
  printf("%.12lf\n", getMax(e));
  return 0;
}
