#include <bits/stdc++.h>
struct line {
  long long left;
  long long right;
};
struct line l[100000 + 7];
using namespace std;
int cmp(struct line a, struct line b) {
  if (a.left != b.left)
    return a.left > b.left;
  else
    return a.right > b.right;
}
int main() {
  int n, i;
  int x1, x2;
  while (scanf("%d", &n) != EOF) {
    scanf("%d%d", &x1, &x2);
    for (i = 0; i < n; i++) {
      int k, b;
      scanf("%d%d", &k, &b);
      l[i].left = (long long)k * x1 + b;
      l[i].right = (long long)k * x2 + b;
    }
    sort(l, l + n, cmp);
    for (i = 0; i < n - 1; i++) {
      if (l[i].right < l[i + 1].right) break;
    }
    if (i == n - 1)
      printf("NO\n");
    else
      printf("YES\n");
  }
  return 0;
}
