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* = *k*_{*i*}·*x* + *b*_{*i*}$. 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 $*x*_{1} < *x*_{2}$. In other words, is it true that there are $1 ≤ *i* < *j* ≤ *n*$ and $*x*', *y*'$, such that:

• $*y*' = *k*_{*i*} * *x*' + *b*_{*i*}$, that is, point $(*x*', *y*')$ belongs to the line number $*i*$;
• $*y*' = *k*_{*j*} * *x*' + *b*_{*j*}$, that is, point $(*x*', *y*')$ belongs to the line number $*j*$;
• $*x*_{1} < *x*' < *x*_{2}$, that is, point $(*x*', *y*')$ lies inside the strip bounded by $*x*_{1} < *x*_{2}$.

You can't leave Anton in trouble, can you? Write a program that solves the given task.

Input

The first line of the input contains an integer $*n*$ ($2 ≤ *n* ≤ 100 000$) — the number of lines in the task given to Anton. The second line contains integers $*x*_{1}$ and $*x*_{2}$ ($- 1 000 000 ≤ *x*_{1} < *x*_{2} ≤ 1 000 000$) defining the strip inside which you need to find a point of intersection of at least two lines.

The following $*n*$ lines contain integers $*k*_{*i*}$, $*b*_{*i*}$ ($- 1 000 000 ≤ *k*_{*i*}, *b*_{*i*} ≤ 1 000 000$) — the descriptions of the lines. It is guaranteed that all lines are pairwise distinct, that is, for any two $*i* ≠ *j*$ it is true that either $*k*_{*i*} ≠ *k*_{*j*}$, or $*b*_{*i*} ≠ *b*_{*j*}$.

Output

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).

Note

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