Problem: Mikhail the Freelancer dreams of two things: to become a cool programmer and to buy a flat in Moscow. To become a cool programmer, he needs at least p experience points, and a desired flat in Moscow costs q dollars. Mikhail is determined to follow his dreams and registered at a freelance site.

He has suggestions to work on n distinct projects. Mikhail has already evaluated that the participation in the i-th project will increase his experience by ai per day and bring bi dollars per day. As freelance work implies flexible working hours, Mikhail is free to stop working on one project at any time and start working on another project. Doing so, he receives the respective share of experience and money. Mikhail is only trying to become a cool programmer, so he is able to work only on one project at any moment of time.

Find the real value, equal to the minimum number of days Mikhail needs to make his dream come true.

For example, suppose Mikhail is suggested to work on three projects and a1 = 6, b1 = 2, a2 = 1, b2 = 3, a3 = 2, b3 = 6. Also, p = 20 and q = 20. In order to achieve his aims Mikhail has to work for 2.5 days on both first and third projects. Indeed, a1·2.5 + a2·0 + a3·2.5 = 6·2.5 + 1·0 + 2·2.5 = 20 and b1·2.5 + b2·0 + b3·2.5 = 2·2.5 + 3·0 + 6·2.5 = 20.

Input

The first line of the input contains three integers n, p and q (1 ≤ n ≤ 100 000, 1 ≤ p, q ≤ 1 000 000) — the number of projects and the required number of experience and money.

Each of the next n lines contains two integers ai and bi (1 ≤ ai, bi ≤ 1 000 000) — the daily increase in experience and daily income for working on the i-th project.

Output

Print a real value — the minimum number of days Mikhail needs to get the required amount of experience and money. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6. 

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.

Examples

Input

3 20 20
6 2
1 3
2 6


Output

5.000000000000000


Input

4 1 1
2 3
3 2
2 3
3 2


Output

0.400000000000000

Note

First sample corresponds to the example in the problem statement.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const double eps = 1e-8;
const double inf = 1e16;
int n;
struct Point {
  double x, y, agl;
  Point() {}
  Point(double x, double y) : x(x), y(y) {}
  friend Point operator+(const Point &p, const Point &q) {
    return Point(p.x + q.x, p.y + q.y);
  }
  friend Point operator-(const Point &p, const Point &q) {
    return Point(p.x - q.x, p.y - q.y);
  }
  friend Point operator*(const Point &p, const double &t) {
    return Point(p.x * t, p.y * t);
  }
  friend double operator*(const Point &p, const Point &q) {
    return p.x * q.y - p.y * q.x;
  }
  friend bool operator<(const Point &p, const Point &q) {
    return fabs(p.agl - q.agl) > eps ? p.agl < q.agl : p.y > q.y;
  }
} p[maxn];
struct Line {
  Point p, v;
  Line() {}
  Line(Point p, Point v) : p(p), v(v) {}
} l[maxn], L;
int top;
Point get_intersection(Line l1, Line l2) {
  Point u = l1.p - l2.v;
  double t = (l2.v * u) / (l1.v * l2.v);
  return l1.p + l1.v * t;
}
bool on_left(Line l, Point p) { return l.v * (p - l.p) > eps; }
bool on_line(Line l, Point p) {
  Point q = l.p + l.v;
  double min_x = min(l.p.x, q.x), max_x = max(l.p.x, q.x);
  double min_y = min(l.p.y, q.y), max_y = max(l.p.y, q.y);
  return min_x <= p.x + eps && p.x <= max_x + eps && min_y <= p.y + eps &&
         p.y <= max_y + eps;
}
void get_convex_hall() {
  double min_y = inf;
  int pos;
  for (int i = 0; i < n; ++i)
    if (p[i].y < min_y || (fabs(p[i].y - min_y) <= eps && p[i].x < p[pos].x))
      pos = i, min_y = p[i].y;
  swap(p[0], p[pos]);
  for (int i = 1; i < n; ++i)
    p[i].agl = atan2(p[i].y - p[0].y, p[i].x - p[0].x);
  sort(p + 1, p + n);
  Point last = p[0];
  for (int i = 1; i < n; ++i) {
    if ((i ^ 1) && fabs(p[i].agl - p[i - 1].agl) <= eps) continue;
    while (top && !on_left(l[top], p[i])) top--;
    if (top) last = l[top].p + l[top].v;
    l[++top] = Line(last, p[i] - last);
  }
  last = l[top].p + l[top].v;
  l[++top] = Line(last, p[0] - last);
  Point ans = Point(0, 0);
  for (int i = 1; i <= top; ++i) {
    Point now = get_intersection(l[i], L);
    if (on_line(l[i], now) && now.y > ans.y) ans = now;
  }
  printf("%.16lf\n", L.v.y / ans.y);
}
int main() {
  scanf("%d%lf%lf", &n, &L.v.x, &L.v.y);
  L.p = Point(0, 0);
  double max_a = -inf, max_b = -inf;
  for (int i = 0; i < n; ++i) {
    scanf("%lf%lf", &p[i].x, &p[i].y);
    max_a = max(max_a, p[i].x);
    max_b = max(max_b, p[i].y);
  }
  p[n++] = Point(max_a, 0), p[n++] = Point(0, max_b);
  get_convex_hall();
}