#include <bits/stdc++.h>
using namespace std;
struct node {
  double val;
  int idx;
};
bool comp(node a, node b) { return a.val < b.val; }
vector<node> v;
int pt[100005][2];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  double x1, x2;
  cin >> x1 >> x2;
  double eps = 1e-9;
  x1 += eps;
  x2 -= eps;
  for (int i = 1; i <= n; i++) cin >> pt[i][0] >> pt[i][1];
  node temp;
  v.clear();
  for (int i = 1; i <= n; i++) {
    temp.idx = i;
    double qw = pt[i][0];
    qw *= x1;
    qw += pt[i][1];
    temp.val = qw;
    v.push_back(temp);
  }
  sort(v.begin(), v.end(), comp);
  double pre = -1e18;
  for (int i = 0; i < v.size(); i++) {
    int cord = v[i].idx;
    double qw = pt[cord][0];
    qw *= x2;
    qw += pt[cord][1];
    if (qw <= pre) {
      cout << "YES\n";
      return 0;
    }
    pre = qw;
  }
  cout << "NO\n";
  return 0;
}
