#include <bits/stdc++.h>
using namespace std;
vector<pair<double, double> > v1, v2;
int main() {
  int n;
  scanf("%d", &n);
  int i;
  double x1, x2;
  scanf("%lf%lf", &x1, &x2);
  for (i = 0; i < n; ++i) {
    double k, b;
    scanf("%lf%lf", &k, &b);
    v1.push_back(make_pair(k, b));
  }
  for (i = 0; i < n; ++i) {
    v2.push_back(make_pair(v1[i].first * (x1 + 0.0000001) + v1[i].second,
                           v1[i].first * (x2 - 0.0000001) + v1[i].second));
  }
  sort(v2.begin(), v2.end());
  double maxm = v2[0].second;
  for (i = 1; i < n; ++i) {
    if (v2[i].second < maxm) {
      printf("YES");
      return 0;
    }
    maxm = max(maxm, v2[i].second);
  }
  printf("NO");
  return 0;
}
