#include <bits/stdc++.h>
using namespace std;
int main() {
  map<long long int, pair<long long int, long long int> > arr;
  map<long long int, pair<long long int, long long int> >::iterator it, it1,
      it2;
  long long int y1, y2;
  long long int n, x1, x2, k, b, num = 0;
  cin >> n;
  cin >> x1 >> x2;
  for (int i = 0; i < n; i++) {
    cin >> k >> b;
    y1 = k * x1 + b;
    y2 = k * x2 + b;
    it = arr.find(y1);
    if (it == arr.end())
      arr.insert(make_pair(y1, make_pair(y2, y2)));
    else {
      if (y2 < it->second.first) it->second.first = y2;
      if (y2 > it->second.second) it->second.second = y2;
    }
  }
  it = arr.end();
  it--;
  for (it1 = arr.begin(); it1 != it; it1++) {
    it2 = next(it1, 1);
    if (it1->second.second > it2->second.first) {
      cout << "YES";
      return 0;
    }
  }
  cout << "NO";
  return 0;
}
