#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000 + 10;
pair<long long, long long> p[MAXN];
int main() {
  bool chck = false;
  int n, x1, x2;
  scanf("%d %d %d", &n, &x1, &x2);
  for (int i = 0; i < n; i++) {
    long long k, l;
    scanf("%I64d %I64d", &k, &l);
    p[i].first = (x1 * k) + l;
    p[i].second = (x2 * k) + l;
  }
  sort(p, p + n);
  for (int i = 0; i < n - 1; i++) {
    if (p[i + 1].second < p[i].second) {
      chck = true;
      break;
    }
  }
  if (chck == false)
    printf("NO\n");
  else
    printf("YES\n");
}
