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.util.Arrays;
import java.util.Deque;
import java.math.BigDecimal;
import java.io.OutputStreamWriter;
import java.io.OutputStream;
import java.util.Collection;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.util.List;
import java.io.Closeable;
import java.io.Writer;
import java.util.Comparator;
import java.util.ArrayDeque;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) throws Exception {
        Thread thread = new Thread(null, new TaskAdapter(), "", 1 << 29);
        thread.start();
        thread.join();
    }

    static class TaskAdapter implements Runnable {
        @Override
        public void run() {
            InputStream inputStream = System.in;
            OutputStream outputStream = System.out;
            FastInput in = new FastInput(inputStream);
            FastOutput out = new FastOutput(outputStream);
            CFreelancersDreams solver = new CFreelancersDreams();
            solver.solve(1, in, out);
            out.close();
        }
    }

    static class CFreelancersDreams {
        public void solve(int testNumber, FastInput in, FastOutput out) {
            int n = in.readInt();
            int p = in.readInt();
            int q = in.readInt();
            Point2 target = new Point2(p, q);
            Line2 to = new Line2(Point2.ORIGIN, target);
            Point2[] pts = new Point2[n + 1];
            double ans = 1e18;
            for (int i = 0; i < n; i++) {
                pts[i] = new Point2(in.readInt(), in.readInt());
                ans = Math.min(Math.max(target.x / pts[i].x, target.y / pts[i].y), ans);
            }
            pts[n] = Point2.ORIGIN;
            Point2[] ch = ConvexHull2.grahamScan(Arrays.asList(pts)).toArray(new Point2[0]);
            for (int i = 0; i < ch.length; i++) {
                Point2 cur = ch[i];
                Point2 next = ch[(i + 1) % ch.length];
                if (cur == Point2.ORIGIN || next == Point2.ORIGIN) {
                    continue;
                }
                Line2 line = new Line2(cur, next);
                if (to.side(cur) != to.side(next)) {
                    Point2 pt = Line2.intersect(to, line);
                    ans = Math.min(ans, Math.max(target.x / pt.x, target.y / pt.y));
                }
            }
            out.println(ans);
        }

    }

    static class GeoConstant {
        public static final double PREC = 1e-12;

        public static boolean isZero(double x) {
            return -PREC <= x && x <= PREC;
        }

        public static int sign(double x) {
            return isZero(x) ? 0 : x < 0 ? -1 : 1;
        }

        public static int compare(double a, double b) {
            return sign(a - b);
        }

        public static double cross(double x1, double y1, double x2, double y2) {
            return x1 * y2 - y1 * x2;
        }

    }

    static class FastInput {
        private final InputStream is;
        private byte[] buf = new byte[1 << 13];
        private int bufLen;
        private int bufOffset;
        private int next;

        public FastInput(InputStream is) {
            this.is = is;
        }

        private int read() {
            while (bufLen == bufOffset) {
                bufOffset = 0;
                try {
                    bufLen = is.read(buf);
                } catch (IOException e) {
                    bufLen = -1;
                }
                if (bufLen == -1) {
                    return -1;
                }
            }
            return buf[bufOffset++];
        }

        public void skipBlank() {
            while (next >= 0 && next <= 32) {
                next = read();
            }
        }

        public int readInt() {
            int sign = 1;

            skipBlank();
            if (next == '+' || next == '-') {
                sign = next == '+' ? 1 : -1;
                next = read();
            }

            int val = 0;
            if (sign == 1) {
                while (next >= '0' && next <= '9') {
                    val = val * 10 + next - '0';
                    next = read();
                }
            } else {
                while (next >= '0' && next <= '9') {
                    val = val * 10 - next + '0';
                    next = read();
                }
            }

            return val;
        }

    }

    static class ConvexHull2 {
        public static Collection<Point2> grahamScan(List<Point2> pointPolygon) {
            final Point2[] points = pointPolygon.toArray(new Point2[0]);
            int n = points.length;
            for (int i = 1; i < n; i++) {
                int cmp = Point2.SORT_BY_XY.compare(points[i], points[0]);
                if (cmp >= 0) {
                    continue;
                }
                SequenceUtils.swap(points, 0, i);
            }


            Comparator<Point2> cmp = Point2.sortByPolarAngleAround(points[0]);
            Arrays.sort(points, 1, n, cmp);

            int shrinkSize = 2;
            for (int i = 2; i < n; i++) {
                if (cmp.compare(points[i], points[shrinkSize - 1]) == 0) {
                    if (Point2.dist2(points[i], points[0]) > Point2.dist2(points[shrinkSize - 1], points[0])) {
                        points[shrinkSize - 1] = points[i];
                    }
                } else {
                    points[shrinkSize++] = points[i];
                }
            }

            n = shrinkSize;
            Deque<Point2> stack = new ArrayDeque<>(n);
            stack.addLast(points[0]);
            for (int i = 1; i < n; i++) {
                while (stack.size() >= 2) {
                    Point2 last = stack.removeLast();
                    Point2 second = stack.peekLast();
                    if (GeoConstant.sign(Point2.cross(second, points[i], last)) < 0) {
                        stack.addLast(last);
                        break;
                    }
                }
                stack.addLast(points[i]);
            }

            return stack;
        }

    }

    static class Line2 {
        public Point2 vec;
        public double c;

        public Line2(Point2 vec, double c) {
            this.vec = vec;
            this.c = c;
        }

        public Line2(double a, double b, double c) {
            this(new Point2(b, -a), c);
        }

        public Line2(Point2 a, Point2 b) {
            this.vec = Point2.minus(b, a);
            this.c = Point2.cross(vec, a);
        }

        private double side0(Point2 pt) {
            return Point2.cross(vec, pt) - c;
        }

        public int side(Point2 pt) {
            return GeoConstant.sign(side0(pt));
        }

        public static Point2 intersect(Line2 a, Line2 b) {
            double d = Point2.cross(a.vec, b.vec);
            if (GeoConstant.sign(d) == 0) {
                return null;
            }
            return Point2.div(Point2.minus(Point2.mul(b.vec, a.c), Point2.mul(a.vec, b.c)), d);
        }

        public String toString() {
            return -vec.y + "x + " + vec.x + "y = " + c;
        }

    }

    static class Point2 implements Cloneable {
        public static final Comparator<Point2> SORT_BY_XY = (a, b) ->
        {
            int ans = GeoConstant.compare(a.x, b.x);
            if (ans == 0) {
                ans = GeoConstant.compare(a.y, b.y);
            }
            return ans;
        };
        public static final Point2 ORIGIN = new Point2(0, 0);
        public final double x;
        public final double y;

        public static Comparator<Point2> sortByPolarAngleAround(Point2 center) {
            return (a, b) -> {
                int aHalf = half(a.x - center.x, a.y - center.y);
                int bHalf = half(b.x - center.x, b.y - center.y);
                if (aHalf != bHalf) {
                    return aHalf - bHalf;
                }
                return orient(center, b, a);
            };
        }

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

        public Point2() {
            this(0, 0);
        }

        private static int half(double x, double y) {
            return y > 0 || y == 0 && x < 0 ? 1 : 0;
        }

        public static Point2 minus(Point2 a, Point2 b) {
            return new Point2(a.x - b.x, a.y - b.y);
        }

        public static Point2 mul(Point2 a, double d) {
            return new Point2(a.x * d, a.y * d);
        }

        public static Point2 div(Point2 a, double d) {
            return new Point2(a.x / d, a.y / d);
        }

        public static double cross(Point2 a, Point2 b) {
            return a.x * b.y - a.y * b.x;
        }

        public static double cross(Point2 a, Point2 b, Point2 c) {
            return GeoConstant.cross(b.x - a.x, b.y - a.y,
                    c.x - a.x, c.y - a.y);
        }

        public static int orient(Point2 a, Point2 b, Point2 c) {
            return GeoConstant.sign(GeoConstant.cross(b.x - a.x, b.y - a.y, c.x - a.x, c.y - a.y));
        }

        public static double dist2(Point2 a, Point2 b) {
            double dx = a.x - b.x;
            double dy = a.y - b.y;
            return dx * dx + dy * dy;
        }

        public Point2 clone() {
            try {
                return (Point2) super.clone();
            } catch (CloneNotSupportedException e) {
                throw new RuntimeException(e);
            }
        }

        public String toString() {
            return String.format("(%.6f, %.6f)", x, y);
        }

    }

    static class FastOutput implements AutoCloseable, Closeable, Appendable {
        private static final int THRESHOLD = 1 << 13;
        private final Writer os;
        private StringBuilder cache = new StringBuilder(THRESHOLD * 2);

        public FastOutput append(CharSequence csq) {
            cache.append(csq);
            return this;
        }

        public FastOutput append(CharSequence csq, int start, int end) {
            cache.append(csq, start, end);
            return this;
        }

        private void afterWrite() {
            if (cache.length() < THRESHOLD) {
                return;
            }
            flush();
        }

        public FastOutput(Writer os) {
            this.os = os;
        }

        public FastOutput(OutputStream os) {
            this(new OutputStreamWriter(os));
        }

        public FastOutput append(char c) {
            cache.append(c);
            afterWrite();
            return this;
        }

        public FastOutput append(double c) {
            cache.append(new BigDecimal(c).toPlainString());
            afterWrite();
            return this;
        }

        public FastOutput append(String c) {
            cache.append(c);
            afterWrite();
            return this;
        }

        public FastOutput println(double c) {
            return append(c).println();
        }

        public FastOutput println() {
            return append(System.lineSeparator());
        }

        public FastOutput flush() {
            try {
                os.append(cache);
                os.flush();
                cache.setLength(0);
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
            return this;
        }

        public void close() {
            flush();
            try {
                os.close();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

        public String toString() {
            return cache.toString();
        }

    }

    static class SequenceUtils {
        public static <T> void swap(T[] data, int i, int j) {
            T tmp = data[i];
            data[i] = data[j];
            data[j] = tmp;
        }

    }
}