#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> vs[123456];
int main() {
  int n;
  cin >> n;
  long long x1, x2;
  cin >> x1;
  cin >> x2;
  long long k, b, p1, p2;
  for (int i = 0; i < n; i++) {
    cin >> k >> b;
    vs[i].first = k * x1 + b;
    vs[i].second = k * x2 + b;
  }
  sort(vs, vs + n);
  for (int i = 0; i < n - 1; i++) {
    if (vs[i + 1].second < vs[i].second) {
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
