#include <bits/stdc++.h>
struct cross {
  long long int up, down;
} v[110000];
bool comp(cross l, cross r) {
  if (l.down == r.down) return l.up < r.up;
  return l.down < r.down;
}
using namespace std;
int main() {
  long long int x1, x2, a, b;
  int n;
  cin >> n >> x1 >> x2;
  for (int i = 0; i < n; i++) {
    cin >> a >> b;
    v[i].down = a * x1 + b;
    v[i].up = a * x2 + b;
  }
  sort(v, v + n, comp);
  for (int i = 1; i < n; i++) {
    if (v[i].up < v[i - 1].up && v[i].down != v[i - 1].down) {
      cout << "YES";
      return 0;
    }
  }
  cout << "NO";
  return 0;
}
