Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Freelancer's Dreams

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputMikhail 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 *a*_{i} per day and bring *b*_{i} 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 *a*_{1} = 6, *b*_{1} = 2, *a*_{2} = 1, *b*_{2} = 3, *a*_{3} = 2, *b*_{3} = 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, *a*_{1}·2.5 + *a*_{2}·0 + *a*_{3}·2.5 = 6·2.5 + 1·0 + 2·2.5 = 20 and *b*_{1}·2.5 + *b*_{2}·0 + *b*_{3}·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 *a*_{i} and *b*_{i} (1 ≤ *a*_{i}, *b*_{i} ≤ 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 .

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.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/26/2017 07:17:41 (c2).

Desktop version, switch to mobile version.
User lists

Name |
---|