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 JAVA):

Solution:
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

public class Main {

  public static class Point implements Comparable<Point> {
    public final int x, y;

    public Point(int x, int y) {
      this.x = x;
      this.y = y;
    }

    public Point minus(Point o) {
      return new Point(x - o.x, y - o.y);
    }

    public long cross(Point o) {
      return x * 1l * o.y - o.x * 1l * y;
    }

    @Override
    public int compareTo(Point o) {
      if (x != o.x)
        return x - o.x;
      return y - o.y;
    }

    public String toString() {
      return "(" + x + ", " + y + ")";
    }
  }

  public static Point[] convexHull2(Point[] p) {
    PointInPolygonQuery pip = new PointInPolygonQuery(p);
//    System.out.println("Upper: " + Arrays.toString(pip.upper));
//    System.out.println("Lower: " + Arrays.toString(pip.lower));
//    System.out.println("Total: " + Arrays.toString(pip.total));
    return pip.total;
  }

  static class PointInPolygonQuery {
    Point[] upper, lower, total;
    double minx = Integer.MAX_VALUE;
    double maxx = Integer.MIN_VALUE;
    double miny1 = Integer.MAX_VALUE;
    double miny2 = Integer.MIN_VALUE;
    double maxy1 = Integer.MAX_VALUE;
    double maxy2 = Integer.MIN_VALUE;

    PointInPolygonQuery(Point[] p) {
      findHull(p);
      total = new Point[upper.length + lower.length - 2];
      int ptr = 0;
      for (int i = lower.length - 2; i >= 0; i--) {
        total[ptr++] = lower[i];
      }
      for (int i = 0; i < (upper.length + 1) / 2; i++) {
        Point temp = upper[i];
        upper[i] = upper[upper.length - 1 - i];
        upper[upper.length - 1 - i] = temp;
      }
      for (int i = 1; i < upper.length; i++) {
        total[ptr++] = upper[i];
      }
      total = Arrays.copyOf(total, ptr);
      
      for (int i = 0; i < total.length; i++) {
        if (total[i].x < minx) {
          minx = total[i].x;
        }
        if (total[i].x > maxx) {
          maxx = total[i].x;
        }
      }
      for (int i = 0; i < total.length; i++) {
        if (total[i].x == minx) {
          miny1 = Math.min(miny1, total[i].y);
          miny2 = Math.max(miny2, total[i].y);
        }
        if (total[i].x == maxx) {
          maxy1 = Math.min(maxy1, total[i].y);
          maxy2 = Math.max(maxy2, total[i].y);
        }
      }
    }

    int query(Point p) {
      if (p.x < upper[0].x || p.x > upper[upper.length - 1].x)
        return -1;
      if (p.x == minx) {
        if (p.y >= miny1 && p.y <= miny2) {
          return 0;
        } else
          return -1;
      }
      if (p.x == maxx) {
        if (p.y >= maxy1 && p.y <= maxy2) {
          return 0;
        } else
          return -1;
      }
      return -1 * above(lower, p) * above(upper, p);
    }

    int above(Point[] hull, Point p) {

      int lo = 0, hi = hull.length - 1;
      while (true) {
        int mid = (lo + hi) / 2;
        if (p.x >= hull[mid].x && p.x <= hull[mid + 1].x) {
          // System.out.println("Query for " + p +" :: > " + hull[mid] +" "+
          // hull[mid + 1]);
          return (int) Math.signum(hull[mid + 1].minus(hull[mid]).cross(p.minus(hull[mid])));

        } else if (p.x >= hull[mid].x)
          lo = mid;
        else
          hi = mid;
      }
    }

    void findHull(Point[] points) {
      int n = points.length;
      Arrays.sort(points);
      lower = new Point[2 * n];
      upper = new Point[2 * n];
      int k = 0, start = 0;
      for (int i = 0; i < n; i++) {
        Point p = points[i];
        if (i > 0 && points[i - 1].x == points[i].x && points[i - 1].y == points[i].y)
          continue;
        while (k - start >= 2 && p.minus(lower[k - 1]).cross(p.minus(lower[k - 2])) >= 0)
          k--;
        lower[k++] = p;
      }
      lower = Arrays.copyOf(lower, k);
      start = 0;
      k = 0;
      for (int i = n - 1; i >= 0; i--) {
        Point p = points[i];
        if (i + 1 < n && points[i].x == points[i + 1].x && points[i].y == points[i + 1].y)
          continue;
        while (k - start >= 2 && p.minus(upper[k - 1]).cross(p.minus(upper[k - 2])) >= 0)
          k--;
        upper[k++] = p;
      }
      upper = Arrays.copyOf(upper, k);
    }
  }

  static long cross(Point a, Point b, Point c) {
    return (long) (b.x - a.x) * (c.y - a.y) - (long) (b.y - a.y) * (c.x - a.x);
  }

  double eps = 1e-8;

  static double intersection(Point p11, Point p12, Point p21, Point p22) {
    int x1 = Math.min(p11.x, p12.x);
    int x2 = Math.max(p11.x, p12.x);
    int y1 = Math.min(p11.y, p12.y);
    int y2 = Math.max(p11.y, p12.y);

    long a1 = p12.y - p11.y, b1 = p11.x - p12.x, c1 = a1 * p11.x + b1 * p11.y;
    long a2 = p22.y - p21.y, b2 = p21.x - p22.x, c2 = a2 * p21.x + b2 * p21.y;
    long det = a1 * b2 - a2 * b1;
    long x = (b2 * c1 - b1 * c2);
    long y = -(a2 * c1 - a1 * c2);
    if (x >= x1 * det && x <= x2 * det && y >= y1 * det && y <= y2 * det)
      return (double) x / det;
    else
      return -1;
  }

  public static void main(String args[]) {
    InputReader in = new InputReader(System.in);
    PrintWriter w = new PrintWriter(System.out);

    int n = in.nextInt();
    int finalX = in.nextInt();
    int finalY = in.nextInt();
    int a[] = new int[n];
    Point[] p = new Point[n + 2];
    for (int i = 0; i < n; i++)
      p[i] = new Point(in.nextInt(), in.nextInt());
    int maxX = 0;
    int maxY = 0;
    for (int i = 0; i < n; i++) {
      maxX = Math.max(p[i].x, maxX);
      maxY = Math.max(p[i].y, maxY);
    }
    p[n] = new Point(maxX, 0);
    p[n + 1] = new Point(0, maxY);
//    p[n + 2] = new Point(-1, -1);
//    System.out.println(Arrays.toString(p));
    
    p = convexHull2(p);
//    System.out.println(Arrays.toString(p));
    for (int i = 0; i < p.length; i++) {
      double ans = -1;
      if ((ans = intersection(p[i], p[(i + 1) % p.length], new Point(0, 0), new Point(finalX, finalY))) != -1) {
        w.println(finalX / ans);
        break;
      }
    }
    w.close();
  }

  static class InputReader {

    private InputStream stream;
    private byte[] buf = new byte[8192];
    private int curChar;
    private int snumChars;
    private SpaceCharFilter filter;

    public InputReader(InputStream stream) {
      this.stream = stream;
    }

    public int snext() {
      if (snumChars == -1)
        throw new InputMismatchException();
      if (curChar >= snumChars) {
        curChar = 0;
        try {
          snumChars = stream.read(buf);
        } catch (IOException e) {
          throw new InputMismatchException();
        }
        if (snumChars <= 0)
          return -1;
      }
      return buf[curChar++];
    }

    public int nextInt() {
      int c = snext();
      while (isSpaceChar(c))
        c = snext();
      int sgn = 1;
      if (c == '-') {
        sgn = -1;
        c = snext();
      }

      int res = 0;

      do {
        if (c < '0' || c > '9')
          throw new InputMismatchException();
        res *= 10;
        res += c - '0';
        c = snext();
      } while (!isSpaceChar(c));

      return res * sgn;
    }

    public long nextLong() {
      int c = snext();
      while (isSpaceChar(c))
        c = snext();
      int sgn = 1;
      if (c == '-') {
        sgn = -1;
        c = snext();
      }

      long res = 0;

      do {
        if (c < '0' || c > '9')
          throw new InputMismatchException();
        res *= 10;
        res += c - '0';
        c = snext();
      } while (!isSpaceChar(c));

      return res * sgn;
    }

    public String readString() {
      int c = snext();
      while (isSpaceChar(c))
        c = snext();
      StringBuilder res = new StringBuilder();
      do {
        res.appendCodePoint(c);
        c = snext();
      } while (!isSpaceChar(c));
      return res.toString();
    }

    public boolean isSpaceChar(int c) {
      if (filter != null)
        return filter.isSpaceChar(c);
      return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public interface SpaceCharFilter {
      public boolean isSpaceChar(int ch);
    }
  }

  static int pointInPolygon(int qx, int qy, Point[] points) {
    int n = points.length;
    int cnt = 0;
    for (int i = 0, j = n - 1; i < n; j = i++) {
      if (points[i].y == qy && (points[i].x == qx
          || points[j].y == qy && (points[i].x <= qx || points[j].x <= qx) && (points[i].x >= qx || points[j].x >= qx)))
        return 0; // boundary
      if ((points[i].y > qy) != (points[j].y > qy)) {
        long det = (long) (points[i].x - qx) * (points[j].y - qy) - (long) (points[j].x - qx) * (points[i].y - qy);
        if (det == 0)
          return 0; // boundary
        if ((det > 0) != (points[j].y - points[i].y > 0))
          ++cnt;
      }
    }
    return cnt % 2 == 0 ? -1 /* exterior */ : 1 /* interior */;
  }
}