#include <bits/stdc++.h>
using namespace std;
const long long INF = 1002000000000000;
const long long MOD = 1000000007;
int main() {
  int n;
  long long b[100005], k[100005], x1, x2;
  vector<pair<long long, long long> > y;
  scanf("%d", &n);
  y.resize(n);
  scanf("%lld%lld", &x1, &x2);
  for (int i = 0; i < n; i++) {
    scanf("%lld%lld", &k[i], &b[i]);
  }
  for (int i = 0; i < n; i++) {
    y[i].first = k[i] * x1 + b[i];
    y[i].second = k[i] * x2 + b[i];
  }
  sort(y.begin(), y.end());
  long long maxi = -INF;
  for (int i = int(1); i <= int(n - 1); i++) {
    if (y[i - 1].second > y[i].second) {
      printf("YES\n");
      return 0;
    }
  }
  printf("NO\n");
  return 0;
}
