The teacher gave Anton a large geometry homework, but he didn't do it (as usual) as he participated in a regular round on Codeforces. In the task he was given a set of n lines defined by the equations y=ki \cdot x+bi. It was necessary to determine whether there is at least one point of intersection of two of these lines, that lays strictly inside the strip between x1 \lt x2. In other words, is it true that there are 1 \le i \lt j \le n and x',y', such that:
y'=kix'+bi, that is, point (x',y') belongs to the line number i; y'=kjx'+bj, that is, point (x',y') belongs to the line number j; x1 \lt x' \lt x2, that is, point (x',y') lies inside the strip bounded by x1 \lt x2.
You can't leave Anton in trouble, can you? Write a program that solves the given task.

The first line of the input contains an integer n (2 \le n \le 100000)- the number of lines in the task given to Anton. The second line contains integers x1 and x2 (-1000000 \le x1 \lt x2 \le 1000000) defining the strip inside which you need to find a point of intersection of at least two lines.

The following n lines contain integers ki, bi (-1000000 \le ki,bi \le 1000000)- the descriptions of the lines. It is guaranteed that all lines are pairwise distinct, that is, for any two i \neq j it is true that either ki \neq kj, or bi \neq bj.

Print "Yes" (without quotes), if there is at least one intersection of two distinct lines, located strictly inside the strip. Otherwise print "No" (without quotes).

In the first sample there are intersections located on the border of the strip, but there are no intersections located strictly inside it.