#include <bits/stdc++.h>
int f(const void* p, const void* q);
using namespace std;
typedef struct pp {
  double x1;
  double x2;
  double t;
  double p;
} ss;
ss a[100005];
int main(void) {
  int n, i, j, k, p, q;
  double x1, x2, y1, y2;
  while (scanf("%d", &n) != EOF) {
    scanf("%lf %lf", &x1, &x2);
    for (i = 0; i < n; i++) {
      scanf("%lf %lf", &a[i].x1, &a[i].x2);
      a[i].t = a[i].x1 * x1 + a[i].x2;
      a[i].p = a[i].x1 * x2 + a[i].x2;
    }
    qsort(a, n, sizeof(ss), f);
    int flag = 0;
    for (i = 1; i < n; i++) {
      if (a[i].p < a[i - 1].p) {
        flag = 1;
        break;
      }
    }
    if (flag) {
      printf("YES\n");
    } else
      printf("NO\n");
  }
  return 0;
}
int f(const void* p, const void* q) {
  ss* ww = (ss*)p;
  ss* ee = (ss*)q;
  if (ww->t == ee->t) {
    return ww->p > ee->p ? 1 : -1;
  } else
    return ww->t > ee->t ? 1 : -1;
}
