跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1508. Anton and Lines

  • ID: 1514
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 计算几何
  • 排序
  • 数学
  • 编程与模拟
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Anton and Lines

题目描述

B. Anton and Lines
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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·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<x2. In other words, is it true that there are 1≤i<j≤n and x',y', such that:

  • y'=ki*x'+bi, that is, point (x',y') belongs to the line number i;
  • y'=kj*x'+bj, that is, point (x',y') belongs to the line number j;
  • x1<x'<x2, that is, point (x',y') lies inside the strip bounded by x1<x2.

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≤100000)− the number of lines in the task given to Anton. The second line contains integers x1 and x2 (-1000000≤x1<x2≤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≤ki,bi≤1000000)− 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 ki≠kj, or bi≠bj.

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

Examples
Input
4
1 2
1 2
1 0
0 1
0 2
Output
NO
Input
2
1 3
1 0
-1 3
Output
YES
Input
2
1 3
1 0
0 2
Output
YES
Input
2
1 3
1 0
0 3
Output
NO
Note

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1019 题。保留原作者与原赛事署名。