#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int res = 0;
  char c;
  while ((c = getchar()) < '0' || c > '9')
    ;
  while (c >= '0' && c <= '9') res = res * 10 + c - '0', c = getchar();
  return res;
}
const int N = 100100;
pair<long long, long long> p[100010];
int main() {
  int n = in();
  int l, r, k, b;
  cin >> l >> r;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &k, &b);
    p[i].first = 1LL * k * l + b;
    p[i].second = 1LL * k * r + b;
  }
  sort(p, p + n);
  for (int i = 1; i < n; i++) {
    if (p[i].second < p[i - 1].second) return 0 * puts("YES");
  }
  puts("NO");
  return 0;
}
