#include <bits/stdc++.h>
using namespace std;
const long long md = 1e9 + 7;
long long n;
pair<long long, long long> a[100005], pts[100005];
map<int, int> mp;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long q, m, k, h, ans = 0, sum = 0, p, x, y, x1, x2;
  cin >> n >> x1 >> x2;
  for (int i = 0; i < n; ++i) {
    cin >> a[i].first >> a[i].second;
    pts[i] = {a[i].first * x1 + a[i].second, a[i].first * x2 + a[i].second};
  }
  sort(pts, pts + n);
  long long mx = pts[0].second;
  for (int i = 1; i < n; ++i) {
    if (pts[i].second < mx)
      return cout << "YES", 0;
    else
      mx = pts[i].second;
  }
  cout << "NO";
}
