#include <bits/stdc++.h>
using namespace std;
struct ok {
  double y1, y2;
};
bool comp(ok a, ok b) { return (a.y1 < b.y1 || (a.y1 == b.y1 && a.y2 < b.y2)); }
int main() {
  int n;
  bool OK = false;
  double x1, x2;
  int k, b;
  ok a[100000];
  cin >> n >> x1 >> x2;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &k, &b);
    a[i].y1 = k * x1 * 1.0 + b + 0.0;
    a[i].y2 = k * x2 * 1.0 + b + 0.0;
  }
  sort(a, a + n, comp);
  double __max_y = a[0].y2;
  for (int i = 1; i < n; i++) {
    if (a[i].y2 < __max_y) OK = true;
    if (__max_y < a[i].y2) __max_y = a[i].y2;
  }
  cout << (OK ? "YES" : "NO");
}
