Codeforces593B. 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 = 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₁ < x₂. In other words, is it true that there are1 ≤ 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₁ < x' < x₂, that is, point (x', y') lies inside the strip bounded by x₁ < x₂.

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₁ and x₂ ( - 1 000 000 ≤ x₁ < x₂ ≤ 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).

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.

 

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
using namespace std;
const int maxn=1000010;
struct Node{
	long long k,b;
	long  long y1,y2;
}A[maxn];
bool cmp(Node a,Node b){
	if(a.y1==b.y1)
		return a.y2<b.y2;
	return a.y1<b.y1;
}
int main()
{
	int n,i;
	long long x1,x2;
	while(scanf("%d",&n)!=EOF){
		scanf("%lld%lld",&x1,&x2);
		for(i=0;i<n;++i){
			scanf("%lld%lld",&A[i].k,&A[i].b);
			A[i].y1=A[i].k*x1+A[i].b;
			A[i].y2=A[i].k*x2+A[i].b;
		}
		sort(A,A+n,cmp);
		for(i=1;i<n;++i){
			if(A[i].y1>A[i-1].y1&&A[i].y2<A[i-1].y2)break;
		}
		if(i<n){
			printf("YES\n");
		}
		else {
			printf("NO\n");
		}
	}
	return 0;
}