#include <bits/stdc++.h>
using namespace std;
double const eps = 1e-8;
struct Line {
  long long y1, y2;
} l[100005];
int cmp(const Line& a, const Line& b) {
  if (a.y1 != b.y1) return a.y1 > b.y1;
  return a.y2 > b.y2;
}
int main() {
  int n;
  long long x1, x2, k, b;
  while (scanf("%d", &n) != EOF) {
    scanf("%I64d%I64d", &x1, &x2);
    for (int i = 0; i < n; i++) {
      scanf("%I64d%I64d", &k, &b);
      l[i].y1 = k * x1 + b;
      l[i].y2 = k * x2 + b;
    }
    sort(l, l + n, cmp);
    long long maxy = l[0].y2;
    int flag = 0;
    for (int i = 1; i < n; i++) {
      if (l[i].y2 > maxy) {
        flag = 1;
        break;
      }
      maxy = l[i].y2;
    }
    if (flag)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
