Given a set of lines, in form of y = k_{i}x +b_{i} , where k_{i} and b_{i} are all integers. You are asked to judge whether there exists a pair of lines that intersect **strictly** inside the interval (x1,x2) (x1<x2, x1 and x2 are integers). That is, the intersection point of two distincet lines, p(x,y), needs to satisfy that x1<x<x2.

The first line of the input contains an integer n (2 ≤ n ≤ 10^{5}), which shows the number of lines given.

The second line contains two integers x1 and x2 ( - 10^{9} ≤ x1 < x2 ≤ 10^{9}) defining the interval that the intersection point should be strictly in.

The following n lines contain integers ki
, bi
( - 10^{6 }≤ ki
, bi ≤ 10^{6}), which describe lines. It is
guaranteed that all lines are pairwise distinct.

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