How to Eat at a Buffet

Some restaurants sell all you can eat buffet lunches and dinners instead of a fixed seated meal. For a hungry student that is usually the better deal. Alice likes buffet meals, but she always worries about how to fill her plate. She values each of the $n$ items on the menu differently, and she wants the total value on her plate to be as large as possible, limited by the area of the plate and by how much of each item is available. The items on the menu are easy to divide, so Alice can take an arbitrary fraction of each dish. Help her fill her plate.

The input consists of $n + 2$ lines.

• The first line contains the number $n$ of different items on the menu.
• The second line contains the area $a$ of Alice's plate, an integer in mm$^2$.
• Each of the next $n$ lines describes one menu item as two integers separated by a space. The first integer is the value $v_i$ of item $i$ per mm$^2$ as perceived by Alice. The second integer is the area $a_i$, in mm$^2$, that item $i$ would occupy if Alice moved all of it onto her plate.

Limits

• $1 \le n \le 1000$
• $0 \le a \le 100000$
• For every $i$ with $0 \le i \le n - 1$:
  • $0 \le v_i \le 100$
  • $0 \le a_i \le 100000000$

Print a single line with one integer, the maximal value that Alice can fit on her plate. Every area and every unit value is an integer, so this maximum is always an integer.