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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.ArrayDeque;
import java.util.Comparator;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author prakharjain
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        _605C solver = new _605C();
        solver.solve(1, in, out);
        out.close();
    }

    static class _605C {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();
            int p = in.nextInt();
            int q = in.nextInt();

            point pq = new point(p, q);

            point[] ps = new point[n];
            double maxa = 0;
            double maxb = 0;
            for (int i = 0; i < n; i++) {
                ps[i] = new point(in.nextInt(), in.nextInt());
                maxa = Math.max(maxa, ps[i].x);
                maxb = Math.max(maxb, ps[i].y);
            }

            double lo = 0;
            double hi = 1000000;

            double ans = 1e7;

            double mid = 1;

            point[] nps = new point[n + 3];

            for (int j = 0; j < n; j++) {
                nps[j] = new point();
                nps[j].x = mid * ps[j].x;
                nps[j].y = mid * ps[j].y;
            }

            nps[n] = new point(0, 0);
            nps[n + 1] = new point(mid * maxa, 0);
            nps[n + 2] = new point(0, mid * maxb);

            GrahamScanConvexHull cv = new GrahamScanConvexHull(nps);
            point[] cvp = cv.convexHull();

//        LineSegmentAndPolygons lsp = new LineSegmentAndPolygons();
//
//        boolean inside = lsp.pointInsidePolygon(pq, cvp);
//
//        if (inside) {
//            ans = Math.min(ans, mid);
//            hi = mid;
//        } else {
//            lo = mid;
//        }


            LineRectangleIntersection lri = new LineRectangleIntersection();

            LineRectangleIntersection.line pqline = lri.new line(0, 0, p, q);

            LineSegmentAndPolygons lsp = new LineSegmentAndPolygons();

            int np = (10000000 + p - 1) / p;
            int nq = (10000000 + q - 1) / q;

            int minm = Math.min(np, nq);
            np = minm * p;
            nq = minm * q;

            point zp = new point(0, 0);
            point ep = new point(np, nq);

            n = cvp.length;
            point ipf = null;
            for (int i = 0; i < n; i++) {
                int next = (i + 1) % n;

                LineRectangleIntersection.line line = lri.new line(cvp[i].x, cvp[i].y, cvp[next].x, cvp[next].y);

                if (lsp.lineSegmentIntersect(zp, ep, cvp[i], cvp[next])) {
                    point ip = line.intersect(pqline);

                    if (ip.x > 0 && ip.y > 0) {
                        ipf = ip;
                        break;
                    }
                }
            }

            DotAndCrossProductApplication dcp = new DotAndCrossProductApplication();
            ans = dcp.distance(pq) / dcp.distance(ipf);

            out.println(ans);
        }

        class point {
            double x;
            double y;

            public point() {
            }

            public point(double x, double y) {
                this.x = x;
                this.y = y;
            }

            public point(point p) {
                this.x = p.x;
                this.y = p.y;
            }

        }

        class LineSegmentAndPolygons {
            double eps = 1e-10;

            double crossProduct(point p1, point p2, point p0) {
                return (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y);
            }

            _605C.Orientation orientationOrderedPoints(point p0, point p1, point p2) {
                double crossProduct = crossProduct(p1, p2, p0);
                if (Math.abs(crossProduct) <= eps) {
                    return _605C.Orientation.COLLINEAR;
                } else if (crossProduct < 0) {
                    return _605C.Orientation.RIGHT;
                } else {
                    return _605C.Orientation.LEFT;
                }
            }

            boolean pointOnLineSegment(point p, point p1, point p2) {
                _605C.Orientation or = orientationOrderedPoints(p1, p, p2);

                double minX = Math.min(p1.x, p2.x);
                double maxX = Math.max(p1.x, p2.x);

                double minY = Math.min(p1.y, p2.y);
                double maxY = Math.max(p1.y, p2.y);

                if (or == _605C.Orientation.COLLINEAR && minX <= p.x && p.x <= maxX
                        && minY <= p.y && p.y <= maxY) {
                    return true;
                }

                return false;
            }

            boolean lineSegmentIntersect(point p1, point p2, point p3, point p4) {
                _605C.Orientation or1 = orientationOrderedPoints(p1, p2, p3);
                _605C.Orientation or2 = orientationOrderedPoints(p1, p2, p4);
                _605C.Orientation or3 = orientationOrderedPoints(p3, p4, p1);
                _605C.Orientation or4 = orientationOrderedPoints(p3, p4, p2);

                if (or1 != or2 && or1 != _605C.Orientation.COLLINEAR && or2 != _605C.Orientation.COLLINEAR
                        && or3 != or4 && or3 != _605C.Orientation.COLLINEAR
                        && or4 != _605C.Orientation.COLLINEAR)
                    return true;

                if (or1 == _605C.Orientation.COLLINEAR && pointOnLineSegment(p3, p1, p2))
                    return true;

                if (or2 == _605C.Orientation.COLLINEAR && pointOnLineSegment(p4, p1, p2))
                    return true;

                if (or3 == _605C.Orientation.COLLINEAR && pointOnLineSegment(p1, p3, p4))
                    return true;

                if (or4 == _605C.Orientation.COLLINEAR && pointOnLineSegment(p2, p3, p4))
                    return true;

                return false;
            }

        }

        enum Orientation {
            LEFT,
            RIGHT,
            COLLINEAR,;
        }

        public class GrahamScanConvexHull {
            double eps = 1e-10;
            point[] vertices;
            int n;

            double crossProduct(point p1, point p2, point p0) {
                return (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y);
            }

            _605C.Orientation orientationOrderedPoints(point p0, point p1, point p2) {
                double crossProduct = crossProduct(p1, p2, p0);
                if (Math.abs(crossProduct) <= eps) {
                    return _605C.Orientation.COLLINEAR;
                } else if (crossProduct < 0) {
                    return _605C.Orientation.RIGHT;
                } else {
                    return _605C.Orientation.LEFT;
                }
            }

            public GrahamScanConvexHull(point[] vertices) {
                this.vertices = vertices;
                this.n = vertices.length;
            }

            void swap(int i, int j) {
                if (i != j) {
                    point temp = vertices[i];
                    vertices[i] = vertices[j];
                    vertices[j] = temp;
                }
            }

            double distanceSquare(point p1, point p2) {
                return (p2.x - p1.x) * (p2.x - p1.x) + (p2.y - p1.y) * (p2.y - p1.y);
            }

            Comparator<point> getComparator(point p0) {
                return (point p1, point p2) ->
                {
                    _605C.Orientation orientation = orientationOrderedPoints(p0, p1, p2);

                    int returnVal;
                    switch (orientation) {
                        case COLLINEAR:
                            double dis1 = distanceSquare(p0, p1);
                            double dis2 = distanceSquare(p0, p2);

                            returnVal = (int) Math.signum(dis1 - dis2);
                            break;

                        case LEFT:
                            returnVal = -1;
                            break;

                        case RIGHT:
                            returnVal = 1;
                            break;

                        default:
                            throw new RuntimeException();
                    }

                    return returnVal;
                };
            }

            point[] convexHull() {
                int minPointInd = 0;

                for (int i = 1; i < n; i++) {
                    if (vertices[i].x < vertices[minPointInd].x ||
                            (vertices[i].x == vertices[minPointInd].x
                                    && vertices[i].y < vertices[minPointInd].y)) {
                        minPointInd = i;
                    }
                }

                swap(0, minPointInd);

                Arrays.sort(vertices, 1, n, getComparator(vertices[0]));

                int m = 1;
                for (int i = 1; i < n; i++) {
                    while (i < n - 1 &&
                            orientationOrderedPoints(vertices[0], vertices[i], vertices[i + 1])
                                    == _605C.Orientation.COLLINEAR) {
                        i++;
                    }

                    vertices[m] = vertices[i];
                    m++;
                }

                if (m < 3) {
                    return new point[0];
                }

                ArrayDeque<point> stack = new ArrayDeque<>();

                stack.addFirst(vertices[0]);
                stack.addFirst(vertices[1]);
                stack.addFirst(vertices[2]);

                for (int i = 3; i < m; i++) {
                    point top = null;
                    point nextToTop = null;

                    do {
                        if (top != null)
                            stack.removeFirst();
                        top = stack.getFirst();
                        stack.removeFirst();
                        nextToTop = stack.getFirst();
                        stack.addFirst(top);
                    } while (orientationOrderedPoints(nextToTop, top, vertices[i]) != _605C.Orientation.LEFT);

                    stack.addFirst(vertices[i]);
                }

                point[] convexHullVertices = new point[stack.size()];

                for (int i = 0; stack.size() > 0; i++) {
                    convexHullVertices[i] = stack.removeFirst();
                }

                return convexHullVertices;
            }

        }

        class LineRectangleIntersection {
            class line {
                double a;
                double b;
                double c;

                public line(double a, double b, double c) {
                    this.a = a;
                    this.b = b;
                    this.c = c;
                }

                public line(double m, double c) {
                    this.a = -m;
                    this.b = 1;
                    this.c = c;
                }

                public line(double x1, double y1, double x2, double y2) {
                    this.a = y2 - y1;
                    this.b = x1 - x2;
                    this.c = a * x1 + b * y1;
                }

                public point intersect(line line) {
                    double det = a * line.b - line.a * b;

                    if (det == 0) { // Parallel lines case
                        return null;
                    } else {
                        point point = new point();

                        //Integer coordinates only when det divides the below numerators
                        point.x = (line.b * c - b * line.c) / det;
                        point.y = (a * line.c - line.a * c) / det;

                        return point;
                    }
                }

            }

        }

        class DotAndCrossProductApplication {
            double distanceSquare(point p) {
                return (p.x) * (p.x) + (p.y) * (p.y);
            }

            double distance(point p) {
                return Math.sqrt(distanceSquare(p));
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

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

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

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

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

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

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void println(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

    }
}