#include <bits/stdc++.h>
using namespace std;
double b[200000 + 7], A[3][200000 + 7];
void Pivot(int m, int n, double A[3][200000 + 7], int *B, int *N, int r,
           int c) {
  int i, j;
  swap(N[c], B[r]);
  A[r][c] = 1.0 / A[r][c];
  for (j = 0; j <= n; j++) {
    if (j != c) A[r][j] *= A[r][c];
  }
  for (i = 0; i <= m; i++) {
    if (i != r) {
      for (j = 0; j <= n; j++) {
        if (j != c) {
          A[i][j] -= A[i][c] * A[r][j];
        }
      }
      A[i][c] = -A[i][c] * A[r][c];
    }
  }
}
int Feasible(int m, int n, double A[3][200000 + 7], int *B, int *N) {
  int r, c, i;
  double p, v;
  while (true) {
    for (p = 100000000000000000, i = 0; i < m; i++) {
      if (A[i][n] < p) {
        p = A[r = i][n];
      }
    }
    if (p > -1e-9) {
      return 1;
    }
    for (p = 0, i = 0; i < n; i++) {
      if (A[r][i] < p) {
        p = A[r][c = i];
      }
    }
    if (p > -1e-9) return 0;
    p = A[r][n] / A[r][c];
    for (i = r + 1; i < m; i++) {
      if (A[i][c] > 1e-9) {
        v = A[i][n] / A[i][c];
        if (v < p) {
          r = i;
          p = v;
        }
      }
    }
    Pivot(m, n, A, B, N, r, c);
  }
}
int Simplex(int m, int n, double A[3][200000 + 7], double *b, double &Ret) {
  int B[200000 + 7], N[200000 + 7], r, c, i;
  double p, v;
  for (i = 0; i < n; i++) {
    N[i] = i;
  }
  for (i = 0; i < m; i++) {
    B[i] = n + i;
  }
  if (!Feasible(m, n, A, B, N)) {
    return 0;
  }
  while (true) {
    for (p = 0, i = 0; i < n; i++) {
      if (A[m][i] > p) {
        p = A[m][c = i];
      }
    }
    if (p < 1e-9) {
      for (i = 0; i < n; i++) {
        if (N[i] < n) {
          b[N[i]] = 0;
        }
      }
      for (i = 0; i < m; i++) {
        if (B[i] < n) {
          b[B[i]] = A[i][n];
        }
      }
      Ret = -A[m][n];
      return 1;
    }
    for (p = 100000000000000000, i = 0; i < m; i++) {
      if (A[i][c] > 1e-9) {
        v = A[i][n] / A[i][c];
        if (v < p) {
          p = v;
          r = i;
        }
      }
    }
    if (p == 100000000000000000) {
      return -1;
    }
    Pivot(m, n, A, B, N, r, c);
  }
}
int main() {
  int n;
  cin >> n;
  double p, q, ret;
  cin >> p >> q;
  for (int i = 0; i < n; i++) {
    scanf("%lf%lf", &A[0][i], &A[1][i]);
    A[0][i] *= -1.0;
    A[1][i] *= -1.0;
    A[2][i] = -1.0;
  }
  A[0][n] = -p;
  A[1][n] = -q;
  A[2][n] = 0.0;
  Simplex(2, n, A, b, ret);
  double ans = 0.0;
  for (int i = 0; i < n; i++) ans += b[i];
  printf("%.8lf\n", ans);
  return 0;
}
