#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve() {
  long long n;
  cin >> n;
  long long x1, x2;
  cin >> x1 >> x2;
  vector<pair<long long, long long> > vp;
  for (long long i = 0, x, y; i < n; i++) {
    cin >> x >> y;
    vp.push_back({x, y});
  }
  vector<pair<long long, long long> > l;
  for (long long i = 0; i < n; i++)
    l.push_back(
        {(vp[i].first * x1) + vp[i].second, (vp[i].first * x2) + vp[i].second});
  sort((l).begin(), (l).end());
  set<long long> sec;
  for (long long i = 0; i < n; i++) {
    if (sec.upper_bound(l[i].second) != sec.end()) {
      cout << "YES";
      return;
    }
    sec.insert(l[i].second);
  }
  cout << "NO";
}
int main() {
  ios_base::sync_with_stdio(false);
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
}
