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