#include <bits/stdc++.h>
using namespace std;
long long line(int k, int b, int x) { return x * (long long)k + b; }
int main(int argc, char* argv[]) {
  int N;
  cin >> N;
  int b1, b2;
  cin >> b1 >> b2;
  map<long long, pair<long long, long long> > mapping;
  bool yes = false;
  for (int i = 0; i < N; i++) {
    int k, b;
    cin >> k >> b;
    long long y1 = line(k, b, b1);
    long long y2 = line(k, b, b2);
    if (mapping.empty()) {
      mapping[y1] = pair<long long, long long>(y2, y2);
    } else {
      map<long long, pair<long long, long long> >::iterator it;
      if (mapping.find(y1) != mapping.end()) {
        it = mapping.find(y1);
        if (y2 < it->second.first) it->second.first = y2;
        if (y2 > it->second.second) {
          it->second.second = y2;
          map<long long, pair<long long, long long> >::iterator it2 = it;
          it2++;
          if (it != mapping.end() && it2 != mapping.end() &&
              it2->second.first < it->second.second) {
            yes = true;
            break;
          }
        }
      } else {
        mapping[y1] = pair<long long, long long>(y2, y2);
        it = mapping.find(y1);
      }
      map<long long, pair<long long, long long> >::iterator itNext = it;
      itNext++;
      if (it != mapping.end() && itNext != mapping.end()) {
        if (itNext->second.first < it->second.second) {
          yes = true;
          break;
        }
      }
      itNext--;
      if (itNext != mapping.begin()) {
        itNext--;
        if (itNext->second.second > it->second.first) {
          yes = true;
          break;
        }
      }
    }
  }
  if (yes)
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
