#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-9;
int n;
long double p, q, a, b;
vector<int> B(2), N;
vector<vector<long double>> D(4);
void Init() {
  for (int i = 0; i < n; ++i) {
    cin >> a >> b;
    D[0][i] = -a;
    D[1][i] = -b;
  }
  D[0][n] = D[1][n] = -1;
  D[0][n + 1] = -p;
  D[1][n + 1] = -q;
  B[0] = n;
  B[1] = n + 1;
  for (int i = 0; i < n; ++i) {
    N[i] = i;
    D[2][i] = 1;
  }
  N[n] = -1;
  D[3][n] = 1;
}
void Pivot(int r, int s) {
  for (int i = 0; i < 4; ++i)
    if (i != r)
      for (int j = 0; j < n + 2; ++j)
        if (j != s) D[i][j] -= D[r][j] * D[i][s] / D[r][s];
  for (int j = 0; j < n + 2; ++j)
    if (j != s) D[r][j] /= D[r][s];
  for (int i = 0; i < 4; ++i)
    if (i != r) D[i][s] /= -D[r][s];
  D[r][s] = 1.0 / D[r][s];
  swap(B[r], N[s]);
}
bool Simplex(int phase) {
  int x = phase == 1 ? 3 : 2;
  while (true) {
    int s = -1;
    for (int j = 0; j <= n; ++j) {
      if (phase == 2 && N[j] == -1) continue;
      if (s == -1 || D[x][j] < D[x][s] || D[x][j] == D[x][s] && N[j] < N[s])
        s = j;
    }
    if (D[x][s] > -EPS) return true;
    int r = -1;
    for (int i = 0; i < 2; ++i) {
      if (D[i][s] < EPS) continue;
      if (r == -1 || D[i][n + 1] / D[i][s] < D[r][n + 1] / D[r][s] ||
          (D[i][n + 1] / D[i][s]) == (D[r][n + 1] / D[r][s]) && B[i] < B[r])
        r = i;
    }
    if (r == -1) return false;
    Pivot(r, s);
  }
}
long double Solve() {
  int r = 0;
  for (int i = 1; i < 2; ++i)
    if (D[i][n + 1] < D[r][n + 1]) r = i;
  if (D[r][n + 1] < -EPS) {
    Pivot(r, n);
    if (!Simplex(1) || D[3][n + 1] < -EPS)
      return -numeric_limits<long double>::infinity();
    for (int i = 0; i < 2; ++i)
      if (B[i] == -1) {
        int s = -1;
        for (int j = 0; j <= n; ++j)
          if (s == -1 || D[i][j] < D[i][s] || D[i][j] == D[i][s] && N[j] < N[s])
            s = j;
        Pivot(i, s);
      }
  }
  if (!Simplex(2)) return numeric_limits<long double>::infinity();
  return D[2][n + 1];
}
int main() {
  cin >> n >> p >> q;
  N.resize(n + 1);
  for (auto &d : D) d.resize(n + 2);
  Init();
  cout << setiosflags(ios::fixed);
  cout << setprecision(10) << -Solve() << endl;
  return 0;
}
