#include <bits/stdc++.h>
using namespace std;
long long n, q, p;
struct pt {
  double x, y;
  pt() { x = 0, y = 0; }
  pt(double x1, double y1) {
    x = x1;
    y = y1;
  }
  pt(const pt& z) {
    x = z.x;
    y = z.y;
  }
  pt operator+(pt& z) { return pt(x + z.x, y + z.y); }
  pt operator-(pt& z) { return pt(x - z.x, y - z.y); }
  pt operator*(double t) { return pt(x * t, y * t); }
  bool operator<(const pt& z) const {
    return make_pair(x, y) < make_pair(z.x, z.y);
  }
  double cross(pt z) { return y * z.x - x * z.y; }
  double dist(pt z) {
    double r = x - z.x;
    r *= r;
    double r1 = y - z.y;
    r1 *= r1;
    return sqrt(r + r1);
  }
};
pt z[100100];
bool comp(pt const& z1, pt const& z2) {
  pt z3 = z1;
  pt z4 = z2;
  double r = (z3 - z[0]).cross(z4 - z[0]);
  if (fabs(r) < 1e-6) return make_pair(z1.x, z1.y) < make_pair(z2.x, z2.y);
  return r < 0;
}
pt fate(pt a, pt b, pt c, pt d) {
  pt l1 = a - b, l2 = c - d;
  double d1 = -l1.y * a.x + l1.x * a.y, d2 = -l2.y * c.x + l2.x * c.y;
  double p1 = l2.x * d1 - l1.x * d2, p2 = -l1.y * d2 + l2.y * d1,
         q = -l1.y * l2.x + l2.y * l1.x;
  return pt(p1 / q, p2 / q);
}
int main() {
  cin >> n >> q >> p;
  int x, y;
  int mxx = 0, mxy = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x, &y);
    z[i].x = x;
    z[i].y = y;
    mxx = max(mxx, x);
    mxy = max(mxy, y);
  }
  z[n++] = pt(mxx, 0);
  z[n++] = pt(0, mxy);
  sort(z, z + n);
  sort(z + 1, z + n, comp);
  vector<pt> con;
  for (int i = 0; i < n; i++) {
    while (con.size() > 1 &&
           (z[i] - con.back()).cross(con[con.size() - 2] - con.back()) > -1e-6)
      con.pop_back();
    con.push_back(z[i]);
  }
  double r = 0;
  for (int i = 0; i < con.size(); i++) {
    int i1 = i + 1;
    i1 %= con.size();
    pt z = fate(pt(0, 0), pt(q, p), con[i], con[i1]);
    if (z.dist(con[i]) - 1e-6 > con[i].dist(con[i1]) ||
        z.dist(con[i1]) - 1e-6 > con[i].dist(con[i1]))
      continue;
    r = max(r, z.dist(pt(0, 0)));
  }
  r = pt(p, q).dist(pt(0, 0)) / r;
  printf("%.10lf\n", r);
  return 0;
}
